Automated Technology for Verification and Analysis

[1]  Sagar Chaki,et al.  Time-bounded analysis of real-time systems , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

[2]  Jorge A. Navas,et al.  The SeaHorn Verification Framework , 2015, CAV.

[3]  Alan J. Hu,et al.  Context-Bounded Translations for Concurrent Software: An Empirical Evaluation , 2010, SPIN.

[4]  Joost-Pieter Katoen,et al.  Robust PCTL model checking , 2012, HSCC '12.

[5]  Salvatore La Torre,et al.  Reducing Context-Bounded Concurrent Reachability to Sequential Reachability , 2009, CAV.

[6]  Sanjit A. Seshia,et al.  Reactive synthesis from signal temporal logic specifications , 2015, HSCC.

[7]  Marta Z. Kwiatkowska,et al.  A game-based abstraction-refinement framework for Markov decision processes , 2010, Formal Methods Syst. Des..

[8]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[9]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[10]  Salvatore La Torre,et al.  Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches - (Competition Contribution) , 2015, TACAS.

[11]  Salvatore La Torre,et al.  Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs , 2015, 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[12]  Daniel Kroening,et al.  A Tool for Checking ANSI-C Programs , 2004, TACAS.

[13]  Krishnendu Chatterjee,et al.  Verification of Markov Decision Processes Using Learning Algorithms , 2014, ATVA.

[14]  Uri Alon,et al.  Response delays and the structure of transcription networks. , 2003, Journal of molecular biology.

[15]  Thomas W. Reps,et al.  Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis , 2008, CAV.

[16]  Stefan Engblom,et al.  Stochastic focusing coupled with negative feedback enables robust regulation in biochemical reaction networks , 2015, Journal of The Royal Society Interface.

[17]  Gennaro Parlato,et al.  CSeq: A Sequentialization Tool for C - (Competition Contribution) , 2013, TACAS.

[18]  Csaba Szepesvári,et al.  Finite-Time Bounds for Fitted Value Iteration , 2008, J. Mach. Learn. Res..

[19]  L. M. Bujorianu,et al.  Approximate Abstractions of Stochastic Hybrid Systems , 2008 .

[20]  Salvatore La Torre,et al.  Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization , 2014, CAV.

[21]  Markus N. Rabe,et al.  CAQE: A Certifying QBF Solver , 2015, 2015 Formal Methods in Computer-Aided Design (FMCAD).

[22]  Shuvendu K. Lahiri,et al.  A Solver for Reachability Modulo Theories , 2012, CAV.

[23]  Salvatore La Torre,et al.  Model-Checking Parameterized Concurrent Programs Using Linear Interfaces , 2010, CAV.

[24]  Bernd Becker,et al.  Skolem Functions for DQBF , 2016, ATVA.

[25]  Salvatore La Torre,et al.  Lazy-CSeq: A Lazy Sequentialization Tool for C - (Competition Contribution) , 2014, TACAS.

[26]  Paolo Zuliani,et al.  BioPSy: An SMT-based Tool for Guaranteed Parameter Set Synthesis of Biological Models , 2015, CMSB.

[27]  François Fages,et al.  A general computational method for robustness analysis with applications to synthetic gene networks , 2009, Bioinform..

[28]  Salvatore La Torre,et al.  Lazy sequentialization for TSO and PSO via shared memory abstractions , 2016, 2016 Formal Methods in Computer-Aided Design (FMCAD).

[29]  Joost-Pieter Katoen,et al.  Three-valued abstraction for probabilistic systems , 2012, J. Log. Algebraic Methods Program..

[30]  D. Bertsekas.  Approximate policy iteration: a survey and some new methods , 2011 .

[31]  Salvatore La Torre,et al.  Analyzing recursive programs using a fixed-point calculus , 2009, PLDI '09.

[32]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[33]  Joël Ouaknine,et al.  Verifying multi-threaded software with impact , 2013, 2013 Formal Methods in Computer-Aided Design.

[34]  Jochen Hoenicke,et al.  Ultimate Automizer with SMTInterpol - (Competition Contribution) , 2013, TACAS.

[35]  Salvatore La Torre,et al.  Verifying Concurrent Programs by Memory Unwinding , 2015, TACAS.

[36]  Leslie Lamport.  A New Approach to Proving the Correctness of Multiprocess Programs , 1979, TOPL.

[37]  Marsha Chechik,et al.  Symbolic optimization with SMT solvers , 2014, POPL.

[38]  Salvatore La Torre,et al.  Sequentializing Parameterized Programs , 2012, FIT.

[39]  Vikram S. Adve,et al.  LLVM: a compilation framework for lifelong program analysis & transformation , 2004, International Symposium on Code Generation and Optimization, 2004. CGO 2004..

[40]  Dejan Nickovic,et al.  Monitoring Temporal Properties of Continuous Signals , 2004, FORMATS/FTRTFT.

[41]  C. Belta,et al.  Formal Verification and Synthesis for Discrete-Time Stochastic Systems , 2015, IEEE Trans. Autom. Control..

[42]  Dirk Beyer,et al.  Reliable and Reproducible Competition Results with BenchExec and Witnesses (Report on SV-COMP 2016) , 2016, TACAS.

[43]  Lubos Brim,et al.  Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks , 2015, CAV.

[44]  Gennaro Parlato,et al.  CSeq: A concurrency pre-processor for sequential C verification tools , 2013, 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[45]  Pranav Garg,et al.  Compositionality Entails Sequentializability , 2011, TACAS.

[46]  Daniel Kroening,et al.  Partial Orders for Efficient Bounded Model Checking of Concurrent Software , 2013, CAV.

[47]  Dinghao Wu,et al.  KISS: keep it simple and sequential , 2004, PLDI '04.

[48]  Zvonimir Rakamaric,et al.  SMACK: Decoupling Source Language Details from Verifier Implementations , 2014, CAV.