Sciweavers

48 search results - page 3 / 10
» An Abstract Interpretation Approach for Automatic Generation...
Sort
View
ICLP
2005
Springer
14 years 2 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
KBSE
1999
IEEE
13 years 11 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
CAV
2008
Springer
161views Hardware» more  CAV 2008»
13 years 8 months ago
Constraint-Based Approach for Analysis of Hybrid Systems
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
Sumit Gulwani, Ashish Tiwari
APLAS
2005
ACM
13 years 8 months ago
Loop Invariants on Demand
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
K. Rustan M. Leino, Francesco Logozzo
FPL
2006
Springer
223views Hardware» more  FPL 2006»
13 years 10 months ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...