Sciweavers

145 search results - page 5 / 29
» Symbolic Execution with Separation Logic
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
TGC
2010
Springer
13 years 5 months ago
Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
David Aspinall, Robert Atkey, Kenneth MacKenzie, D...
HYBRID
2009
Springer
14 years 2 months ago
Optimization of Multi-agent Motion Programs with Applications to Robotic Marionettes
Abstract. In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic co...
Patrick Martin, Magnus Egerstedt
ESOP
2010
Springer
14 years 4 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
CORR
2010
Springer
210views Education» more  CORR 2010»
13 years 7 months ago
Test Case Generation for Object-Oriented Imperative Languages in CLP
Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...