default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st TACAS 2015: London, UK
- Christel Baier
, Cesare Tinelli:
Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. Lecture Notes in Computer Science 9035, Springer 2015, ISBN 978-3-662-46680-3
Invited Talk
- Nan Guan, Yue Tang, Jakaria Abdullah, Martin Stigge, Wang Yi:
Scalable Timing Analysis with Refinement. 3-18
Hybrid systems
- Jean-Baptiste Jeannin, Khalil Ghorbal, Yanni Kouskoulas, Ryan W. Gardner, Aurora C. Schmidt, Erik Zawadzki, André Platzer:
A Formally Verified Hybrid System for the Next-Generation Airborne Collision Avoidance System. 21-36 - Fabian Immler:
Verified Reachability Analysis of Continuous Systems. 37-51 - Alessandro Cimatti, Alberto Griggio, Sergio Mover, Stefano Tonetta:
HyComp: An SMT-Based Model Checker for Hybrid Systems. 52-67 - Parasara Sridhar Duggirala, Sayan Mitra, Mahesh Viswanathan, Matthew Potok:
C2E2: A Verification Tool for Stateflow Models. 68-82
Program Analysis
- Elvira Albert, Jesús Correas Fernández, Guillermo Román-Díez:
Non-cumulative Resource Analysis. 85-100 - Shrawan Kumar, Amitabha Sanyal, Uday P. Khedker:
Value Slice: A New Slicing Concept for Scalable Property Checking. 101-115 - Reng Zeng, Zhuo Sun, Su Liu, Xudong He:
A Method for Improving the Precision and Coverage of Atomicity Violation Predictions. 116-130 - Yu-Fang Chen, Chih-Duo Hong, Nishant Sinha, Bow-Yaw Wang:
Commutativity of Reducers. 131-146
Verification and Abstraction
- Hiroshi Unno, Tachio Terauchi:
Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling. 149-163 - Kedar S. Namjoshi, Richard J. Trefler:
Analysis of Dynamic Process Networks. 164-178
Tool Demonstrations
- Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. 181-187 - Ramiro Demasi, Pablo F. Castro, Nicolás Ricci, Thomas Stephen Edward Maibaum, Nazareno Aguirre:
syntMaskFT: A Tool for Synthesizing Masking Fault-Tolerant Programs from Deontic Specifications. 188-193 - Nikolaj S. Bjørner, Anh-Dung Phan, Lars Fleckenstein:
νZ - An Optimizing SMT Solver. 194-199 - Soonho Kong, Sicun Gao, Wei Chen, Edmund M. Clarke:
dReach: δ-Reachability Analysis for Hybrid Systems. 200-205 - Alexandre David, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marius Mikucionis, Jakob Haahr Taankvist:
Uppaal Stratego. 206-211 - Adel Djoudi, Sébastien Bardin:
BINSEC: Binary Code Analysis with Low-Level Regions. 212-217 - Emmanuel Fleury, Olivier Ly, Gérald Point, Aymeric Vincent:
Insight: An Open Binary Analysis Framework. 218-224 - Alessandro Armando, Gianluca Bocci, Giantonio Chiarelli, Gabriele Costa, Gabriele De Maglie, Rocco Mammoliti, Alessio Merlo:
SAM: The Static Analysis Module of the MAVERIC Mobile App Security Verification Platform. 225-230 - Yann Thierry-Mieg:
Symbolic Model-Checking Using ITS-Tools. 231-237
Stochastic Models
- Jeffery P. Hansen, Lutz Wrage, Sagar Chaki, Dionisio de Niz, Mark H. Klein:
Semantic Importance Sampling for Statistical Model Checking. 241-255 - Nicolas Basset, Marta Z. Kwiatkowska, Ufuk Topcu, Clemens Wiltsche:
Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives. 256-271 - Sadegh Esmaeil Zadeh Soudjani, Caspar Gevaerts, Alessandro Abate:
FAUST 2 : Formal Abstractions of Uncountable-STate STochastic Processes. 272-286
SAT and SMT
- Jeroen Bransen, L. Thomas van Binsbergen, Koen Claessen, Atze Dijkstra:
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving. 289-303 - Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi:
On Parallel Scalable Uniform SAT Witness Generation. 304-319 - Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate Counting in SMT and Value Estimation for Probabilistic Programs. 320-334 - Roberto Sebastiani, Patrick Trentin:
Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions. 335-349
Partial Order Reduction, Bisimulation and Fairness
- Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless Model Checking for TSO and PSO. 353-367 - Anton Wijs:
GPU Accelerated Strong and Branching Bisimilarity Checking. 368-383 - Byron Cook, Heidy Khlaaf, Nir Piterman:
Fairness for Infinite-State Systems. 384-398
Competition on Software Verification
- Dirk Beyer:
Software Verification and Verifiable Witnesses - (Report on SV-COMP 2015). 401-416 - Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl:
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). 417-419 - Wei Wang, Clark W. Barrett:
Cascade - (Competition Contribution). 420-422 - Matthias Dangl, Stefan Löwe, Philipp Wendler:
CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic - (Competition Contribution). 423-425 - Yu-Fang Chen, Chiao Hsieh, Ming-Hsien Tsai, Bow-Yaw Wang, Farn Wang:
CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation - (Competition Contribution). 426-428 - Pablo González de Aledo, Pablo Sánchez Espeso:
FramewORk for Embedded System verification - (Competition Contribution). 429-431 - Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Forester: Shape Analysis Using Tree Automata - (Competition Contribution). 432-435 - Ermenegildo Tomasco, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings - (Competition Contribution). 436-438 - Franck Cassez, Takashi Matsuoka, Edward Pierzchalski, Nathan Smyth:
Perentie: Modular Trace Refinement and Selective Value Tracking - (Competition Contribution). 439-442 - Petr Müller, Petr Peringer, Tomás Vojnar:
Predator Hunting Party (Competition Contribution). 443-446 - Arie Gurfinkel, Temesghen Kahsai, Jorge A. Navas:
SeaHorn: A Framework for Verifying C Programs (Competition Contribution). 447-450 - Arvind Haran, Montgomery Carter, Michael Emmi, Akash Lal, Shaz Qadeer, Zvonimir Rakamaric:
SMACK+Corral: A Modular Verifier - (Competition Contribution). 451-454 - Matthias Heizmann, Daniel Dietsch, Jan Leike, Betim Musa, Andreas Podelski:
Ultimate Automizer with Array Interpolation - (Competition Contribution). 455-457 - Alexander Nutz, Daniel Dietsch, Mostafa Mahmoud Mohamed, Andreas Podelski:
ULTIMATE KOJAK with Memory Safety Checks - (Competition Contribution). 458-460 - Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches - (Competition Contribution). 461-463 - Caterina Urban:
FuncTion: An Abstract Domain Functor for Termination - (Competition Contribution). 464-466
Parameter Synthesis
- Mirco Giacobbe, Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Tiago Paixão, Tatjana Petrov:
Model Checking Gene Regulatory Networks. 469-483 - Ocan Sankur:
Symbolic Quantitative Robustness Analysis of Timed Automata. 484-498
Program Synthesis
- Rajeev Alur, Salar Moarref, Ufuk Topcu:
Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis. 501-516 - Roderick Bloem, Krishnendu Chatterjee, Swen Jacobs, Robert Könighofer:
Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. 517-532 - Roderick Bloem, Bettina Könighofer, Robert Könighofer, Chao Wang:
Shield Synthesis: - Runtime Enforcement for Reactive Systems. 533-548
Program and Runtime Verification
- Ermenegildo Tomasco, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Verifying Concurrent Programs by Memory Unwinding. 551-565 - Julian Tschannen, Carlo A. Furia, Martin Nordio, Nadia Polikarpova:
AutoProof: Auto-Active Functional Verification of Object-Oriented Programs. 566-580 - Clare Cini, Adrian Francalanza:
An LTL Proof System for Runtime Verification. 581-595 - Giles Reger, Helena Cuenca Cruz, David E. Rydeheard:
MarQ: Monitoring at Runtime with QEA. 596-610
Temporal Logic and Automata
- Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud:
Parallel Explicit Model Checking for Generalized Büchi Automata. 613-627 - Dileep Kini, Mahesh Viswanathan:
Limit Deterministic and Probabilistic Automata for LTL ∖ GU. 628-642 - Vince Molnár, Dániel Darvas, András Vörös, Tamás Bartha:
Saturation-Based Incremental LTL Model Checking with Inductive Proofs. 643-657 - Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested Antichains for WS1S. 658-674
Model Checking
- Tom van Dijk, Jaco van de Pol:
Sylvan: Multi-Core Decision Diagrams. 677-691 - Gijs Kant, Alfons Laarman, Jeroen Meijer, Jaco van de Pol, Stefan Blom, Tom van Dijk:
LTSmin: High-Performance Language-Independent Model Checking. 692-707 - Abderahman Kriouile, Wendelin Serwe:
Using a Formal Model to Improve Verification of a Cache-Coherent System-on-Chip. 708-722
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-06 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
