Sciweavers

4722 search results - page 229 / 945
» Encoding Program Executions
Sort
View
KBSE
1997
IEEE
15 years 10 months ago
A Formal Automated Approach for Reverse Engineering Programs with Pointers
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
Gerald C. Gannod, Betty H. C. Cheng
LOPSTR
1997
Springer
15 years 10 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen
CAV
2006
Springer
120views Hardware» more  CAV 2006»
15 years 10 months ago
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
Koushik Sen, Mahesh Viswanathan
ENTCS
1998
90views more  ENTCS 1998»
15 years 6 months ago
Handling ELAN rewrite programs via an exchange format
Designing a programming environment raises difficult implementation problems since such software is not just one piece of code able to execute programs expressed in a given progra...
Peter Borovanský, Salma Jamoussi, Pierre-Et...
WCFLP
2005
ACM
15 years 12 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal