597 search results - page 4 / 120 » Formal Techniques for Java-Like Programs |
ZUM
1994
Springer
14 years 19 days ago
1994
Springer
A critical issuein the designof aprofessionalsoftware engineeringdegreeprogram is the way in which formal methods are integrated into the curriculum. The approach taken by most pr...
TPHOL
2008
IEEE
14 years 3 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
SAS
2001
Springer
14 years 1 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
ICFP
1999
ACM
14 years 27 days ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
SAS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...