Sciweavers

130 search results - page 21 / 26
» Verification of recursive methods on tree-like data structur...
Sort
View
ICFP
2006
ACM
14 years 7 months ago
Algebraic fusion of functions with an accumulating parameter and its improvement
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
Shin-ya Katsumata, Susumu Nishimura
SAS
2004
Springer
14 years 26 days ago
On Logics of Aliasing
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
Marius Bozga, Radu Iosif, Yassine Lakhnech
ASIAMS
2009
IEEE
14 years 19 days ago
Evolutionary-Reduced Ordered Binary Decision Diagram
—Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing ...
Hossein Moeinzadeh, Mehdi Mohammadi, Hossein Pazho...
CAP
2010
13 years 2 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...