Result 1 to 20 of 51 total
Efficient coverability analysis by proof minimization. (English)
Koutny, Maciej (ed.) et al., CONCUR 2012 ‒ concurrency theory. 23rd international conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32939-5/pbk). Lecture Notes in Computer Science 7454, 500-515 (2012).
1
satAbs: a bit-precise verifier for C programs. (Competition contribution). (English)
Flanagan, Cormac (ed.) et al., Tools and algorithms for the construction and analysis of systems. 18th international conference, TACAS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24‒April 1, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28755-8/pbk). Lecture Notes in Computer Science 7214, 552-555 (2012).
2
An interpolating sequent calculus for quantifier-free Presburger arithmetic. (English)
J. Autom. Reasoning 47, No. 4, 341-367 (2011).
3
Linear completeness thresholds for bounded model checking. (English)
Gopalakrishnan, Ganesh (ed.) et al., Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22109-5/pbk). Lecture Notes in Computer Science 6806, 557-572 (2011).
4
Symmetry-aware predicate abstraction for shared-variable concurrent programs. (English)
Gopalakrishnan, Ganesh (ed.) et al., Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22109-5/pbk). Lecture Notes in Computer Science 6806, 356-371 (2011).
5
Symmetry-aware predicate abstraction for shared-variable concurrent programs (Extended technical report). (English)
Comput. Res. Repos. 2011, Article No. 1102.2330 (2011).
6
Beyond quantifier-free interpolation in extensions of Presburger arithmetic. (English)
Jhala, Ranjit (ed.) et al., Verification, model checking, and abstract interpretation. 12th international conference, VMCAI 2011, Austin, TX, USA, January 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18274-7/pbk). Lecture Notes in Computer Science 6538, 88-102 (2011).
7
Symmetry-aware predicate abstraction for shared-variable concurrent programs (English)
CAV, 356-371 (2011).
8
Linear completeness thresholds for bounded model checking (English)
CAV, 557-572 (2011).
9
Beyond quantifier-free interpolation in extensions of Presburger arithmetic (English)
VMCAI, 88-102 (2011).
10
A lazy approach to symmetry reduction. (English)
Formal Asp. Comput. 22, No. 6, 713-733 (2010).
11
Context-aware counter abstraction. (English)
Form. Methods Syst. Des. 36, No. 3, 223-245 (2010).
12
An interpolating sequent calculus for quantifier-free Presburger arithmetic. (English)
Giesl, Jürgen (ed.) et al., Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14202-4/pbk). Lecture Notes in Computer Science 6173. Lecture Notes in Artificial Intelligence, 384-399 (2010).
13
Dynamic cutoff detection in parameterized concurrent programs. (English)
Touili, Tayssir (ed.) et al., Computer aided verification. 22nd international conference, CAV 2010, Edinburgh, UK, July 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14294-9/pbk). Lecture Notes in Computer Science 6174, 645-659 (2010).
14
Boom: Taking Boolean program model checking one step further. (English)
Esparza, Javier (ed.) et al., Tools and algorithms for the construction and analysis of systems. 16th international conference, TACAS 2010, held as part of the joint European conferences on theory and practice of software, ETAPS 2010, Paphos, Cyprus, March 20‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12001-5/pbk). Lecture Notes in Computer Science 6015, 145-149 (2010).
15
Replication and abstraction: symmetry in automated formal verification (English)
Symmetry 2, No. 2, 799-847 (2010).
16
An interpolating sequent calculus for quantifier-free Presburger arithmetic (English)
IJCAR, 384-399 (2010).
17
Boom: taking Boolean program model checking one step further (English)
TACAS, 145-149 (2010).
18
Dynamic cutoff detection in parameterized concurrent programs (English)
CAV, 645-659 (2010).
19
Finding lean induced cycles in binary hypercubes. (English)
Kullmann, Oliver (ed.), Theory and applications of satisfiability testing ‒ SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 18-31 (2009).
20
Result 1 to 20 of 51 total
Start
Contact
Print
General Help
