Sciweavers

67 search results - page 12 / 14
» A Verification Technique Using Term Rewriting Systems and Ab...
Sort
View
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
13 years 6 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
POPL
2004
ACM
14 years 6 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
POPL
2005
ACM
14 years 6 months ago
Synthesis of interface specifications for Java classes
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
P. Madhusudan, Pavol Cerný, Rajeev Alur, Wo...
EMSOFT
2008
Springer
13 years 8 months ago
Automatically transforming and relating Uppaal models of embedded systems
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
Timothy Bourke, Arcot Sowmya
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
14 years 6 months ago
Generating code for holistic query evaluation
We present the application of customized code generation to database query evaluation. The idea is to use a collection of highly efficient code templates and dynamically instantiat...
Konstantinos Krikellas, Marcelo Cintra, Stratis Vi...