96 search results - page 14 / 20 » Analyzing recursive programs using a fixed-point calculus |
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
EMSOFT
2007
Springer
15 years 3 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
105
click to vote
PLANX
2007
14 years 11 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
124
Voted
CC
2008
Springer
14 years 11 months ago
2008
Springer
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...