Sciweavers

499 search results - page 86 / 100
» LTL satisfiability checking
Sort
View
FROCOS
2007
Springer
15 years 1 months ago
Certification of Automated Termination Proofs
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
Evelyne Contejean, Pierre Courtieu, Julien Forest,...
CGI
2004
IEEE
15 years 1 months ago
Computer Aided Design for Origamic Architecture Models with Polygonal Representation
An Origamic Architecture (OA) is a folded sheet of perforated paper from which a three-dimensional structure "pops up" when it is opened. It is similar to a "pop-up...
Jun Mitani, Hiromasa Suzuki
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
15 years 1 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan
FDL
2004
IEEE
15 years 1 months ago
A Formal Verification Approach for IP-based Designs
This paper proposes a formal verification methodology which is smoothly integrated with component-based system-level design, using a divide and conquer approach. The methodology a...
Daniel Karlsson, Petru Eles, Zebo Peng
CSL
2006
Springer
15 years 1 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...