150 search results - page 1 / 30 » The Applicability of Logic Program Analysis and Transformati... |
CADE
1994
Springer
13 years 8 months ago
1994
Springer
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
SPC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
CADE
2001
Springer
14 years 5 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...