Sciweavers

768 search results - page 26 / 154
» Symbolic and Abstract Interpretation for C C Programs
Sort
View
ENTCS
2006
123views more  ENTCS 2006»
13 years 8 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
CP
2006
Springer
13 years 11 months ago
High-Level Nondeterministic Abstractions in
el Nondeterministic Abstractions in C++ Laurent Michel1 , Andrew See1 , and Pascal Van Hentenryck2 1 University of Connecticut, Storrs, CT 06269-2155 2 Brown University, Box 1910, ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CORR
2011
Springer
195views Education» more  CORR 2011»
13 years 2 months ago
Abstract Processes of Place/Transition Systems
Processes of Place/Transition Systems6 Rob van Glabbeeka,b , Ursula Goltzc , Jens-Wolfhard Schickec aNICTA, Sydney, Australia bSchool of Computer Science and Engineering, Universit...
Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard S...
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
POPL
2009
ACM
14 years 8 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...