Sciweavers

18 search results - page 3 / 4
» Reasoning about recursive procedures with parameters
Sort
View
FSTTCS
2006
Springer
13 years 11 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
COMPSAC
2009
IEEE
13 years 8 months ago
Modular Certification of Low-Level Intermediate Representation Programs
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
Yuan Dong, Shengyuan Wang, Liwei Zhang, Ping Yang
ISPD
2005
ACM
116views Hardware» more  ISPD 2005»
14 years 1 months ago
A fast algorithm for power grid design
This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an it...
Jaskirat Singh, Sachin S. Sapatnekar
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 7 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal