Sciweavers

36 search results - page 6 / 8
» Modular verification of code with SAT
Sort
View
SIGSOFT
2006
ACM
14 years 8 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
13 years 11 months ago
A specification-based fitness function for evolutionary testing of object-oriented programs
Encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. As client code is oblivious to the internal state of a server obje...
Yoonsik Cheon, Myoung Kim
APLAS
2010
ACM
13 years 7 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
ICSE
2008
IEEE-ACM
14 years 7 months ago
PLURAL: checking protocol compliance under aliasing
Enforcing compliance to API usage protocols is notoriously hard due to possible aliasing of objects through multiple references. In previous work we proposed a sound, modular appr...
Kevin Bierhoff, Jonathan Aldrich
CODES
2010
IEEE
13 years 5 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...