VMCAI 2014

26 papers

1. A Logic-Based Framework for Verifying Consensus Algorithms · Cezara Dragoi, Thomas A. Henzinger, Helmut Veith, Josef Widder, Damien Zufferey
2. Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes · Lei Song, Lijun Zhang, Jens Chr. Godskesen
3. Cascade 2.0 · Wei Wang, Clark W. Barrett, Thomas Wies
4. Doomsday Equilibria for Omega-Regular Games · Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin
5. Generic Combination of Heap and Value Analyses in Abstract Interpretation · Pietro Ferrara
6. Message-Passing Algorithms for the Verification of Distributed Protocols · Loïg Jezequel, Javier Esparza
7. Modeling Parsimonious Putative Regulatory Networks: Complexity and Heuristic Approach · Vicente Acuña, Andrés Aravena, Alejandro Maass, Anne Siegel
8. Modular Synthesis of Sketches Using Models · Rohit Singh, Rishabh Singh, Zhilei Xu, Rebecca Krosnick, Armando Solar-Lezama
9. Modularly Combining Numeric Abstract Domains with Points-to Analysis, and a Scalable Static Numeric Analyzer for Java · Zhoulai Fu
10. Monitoring Parametric Temporal Logic · Peter Faymonville, Bernd Finkbeiner, Doron A. Peled
11. Parameterized Model Checking of Token-Passing Systems · Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin
12. Policy Iteration-Based Conditional Termination and Ranking Functions · Damien Massé
13. Practical Floating-Point Tests with Integer Code · Anthony Romano
14. Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs · Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Kalmer Apinis
15. Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability · Chao Wang, Kevin Hoang
16. Probabilistic Automata for Safety LTL Specifications · Dileep Kini, Mahesh Viswanathan
17. Refuting Heap Reachability · Bor-Yuh Evan Chang
18. Relational Thread-Modular Static Value Analysis by Abstract Interpretation · Antoine Miné
19. SAT-Based Synthesis Methods for Safety Specs · Roderick Bloem, Robert Könighofer, Martina Seidl
20. Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops · Marius Bozga, Radu Iosif, Filip Konecný
21. Synthesis for Polynomial Lasso Programs · Jan Leike, Ashish Tiwari
22. Synthesis with Identifiers · Rüdiger Ehlers, Sanjit A. Seshia, Hadas Kress-Gazit
23. Timing Analysis of Parallel Software Using Abstract Execution · Andreas Gustavsson, Jan Gustafsson, Björn Lisper
24. Verifying Array Programs by Transforming Verification Conditions · Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
25. Weakest Precondition Synthesis for Compiler Optimizations · Nuno P. Lopes, José Monteiro
26. Widening for Control-Flow · Ben Hardekopf, Ben Wiedermann, Berkeley R. Churchill, Vineeth Kashyap