This work focuses on integrating RAM and Disk Based Verification within the Mur$\varphi Verifier within the IFIP WG 10.5 Advanced Research Working Conference in L'Aquila, Italy.
Practical graph isomorphism, II
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees
Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)
- A. Piperno
- Computer ScienceArXiv
- 30 April 2008
The individualization-refinement paradigm for computing a canonical labeling and/or the automorphism group of a graph is investigated and a new partition refinement algorithm is proposed, together with graph invariants having a global nature.
Retracts in Simply Typed -calculus
A formal system to deduce the existence of retractions is shown to be sound and complete with respect to retractions deenable by linear terms, and results aiming to a system complete w.r.t. the "provable retractions" are established.
Non Deterministic Extensions of Untyped Lambda-Calculus
The main concern of this paper is the interplay between functionality and nondeterminism. We ask whether the analysis of parallelism in terms of sequentiality and nondeterminism, which is usual in…
Non deterministic extensions of untyped-calculus
The main concern of this paper is the study of the interplay between functionality and non determinism. Indeed the rst question we ask is whether the analysis of parallelism in terms of sequentiality…
Optimal-Area Upward Drawings of AVL Trees
- P. Crescenzi, A. Piperno
- MathematicsInternational Symposium Graph Drawing and Network…
- 10 October 1994
We prove that any AVL tree admits a linear-area planar straight-line grid strictly-upward drawing, that is, a drawing in which (a) no two edges intersect, (b) each edge is mapped into a single…
A Filter Model for Concurrent lambda-Calculus
Type-free lazy $\lambda$-calculus is enriched with angelic parallelism and demonic nondeterminism, and the induced logical semantics is fully abstract.