Result 1 to 20 of 65 total
Termination analysis of imperative programs using bitvector arithmetic. (English)
Joshi, Rajeev (ed.) et al., Verified software: Theories, tools, experiments. 4th international conference, VSTTE 2012, Philadelphia, PA, USA, January 28‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27704-7/pbk). Lecture Notes in Computer Science 7152, 261-277 (2012).
1
LLBMC: bounded model checking of C and C++ programs using a compiler IR. (English)
Joshi, Rajeev (ed.) et al., Verified software: Theories, tools, experiments. 4th international conference, VSTTE 2012, Philadelphia, PA, USA, January 28‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27704-7/pbk). Lecture Notes in Computer Science 7152, 146-161 (2012).
2
LLBMC: a bounded model checker for LLVM’s intermediate representation. (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, 542-544 (2012).
3
Termination analysis of C programs using compiler intermediate languages. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 41-50, electronic only (2011).
4
Information flow analysis via path condition refinement. (English)
Degano, Pierpaolo (ed.) et al., Formal aspects of security and trust. 7th international workshop, FAST 2010, Pisa, Italy, September 16‒17, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19750-5/pbk). Lecture Notes in Computer Science 6561, 65-79 (2011).
5
Termination analysis of C programs using compiler intermediate languages (English)
RTA, 41-50 (2011).
6
Analyzing separation of duties constraints with a probabilistic model checker (English)
BIS (Workshops), 18-29 (2011).
7
Probabilistic model checking of constraints in a supply chain business process (English)
BIS, 1-12 (2011).
8
Ordered binary decision diagrams, pigeonhole formulas and beyond. (English)
J. Satisf. Boolean Model. Comput. 7, No. 1, 35-58 (2010).
9
Ordered binary decision diagrams, pigeonhole formulas and beyond (English)
JSAT 7, No. 1, 35-58 (2010).
10
Information flow analysis via path condition refinement (English)
Formal Aspects in Security and Trust, 65-79 (2010).
11
Abstract testing: connecting source code verification with requirements (English)
QUATIC, 89-96 (2010).
12
An exponential lower bound on OBDD refutations for pigeonhole formulas. (English)
Comput. Res. Repos. 2009, Article No. 0909.5038 (2009).
13
Towards automatic software model checking of thousands of linux modules - a case study with avinux. (English)
Softw. Test., Verif. Reliab. 19, No. 2, 155-172 (2009).
14
Problem-sensitive restart heuristics for the DPLL procedure. (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, 356-362 (2009).
15
Proving functional equivalence of two AES implementations using bounded model checking (English)
ICST, 31-40 (2009).
16
Problem-sensitive restart heuristics for the DPLL procedure (English)
SAT, 356-362 (2009).
17
Linking functional requirements and software verification (English)
RE, 295-302 (2009).
18
A new bound for an NP-hard subclass of 3-SAT using backdoors. (English)
Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12‒15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 161-167 (2008).
19
Computation of renameable Horn backdoors. (English)
Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12‒15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 154-160 (2008).
20
Result 1 to 20 of 65 total
Start
Contact
Print
General Help
