Sciweavers

388 search results - page 49 / 78
» Program Analysis Using Symbolic Ranges
Sort
View
JLP
1998
147views more  JLP 1998»
14 years 9 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
OOPSLA
2005
Springer
15 years 3 months ago
CodeQuest: querying source code with datalog
We describe CodeQuest, a system for querying source code. It combines two previous proposals, namely the use of logic programming and database system. Experiments (on projects ran...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor, Kri...
SIGCSE
2009
ACM
143views Education» more  SIGCSE 2009»
15 years 4 months ago
Thinking about computational thinking
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
James J. Lu, George H. L. Fletcher
PLDI
2011
ACM
14 years 16 days 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...
CC
2001
Springer
103views System Software» more  CC 2001»
15 years 2 months ago
Design-Driven Compilation
This paper introduces design-driven compilation, an approach in which the compiler uses design information to drive its analysis and verify that the program conforms to its design....
Radu Rugina, Martin C. Rinard