Sciweavers

2236 search results - page 332 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 2 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
LICS
2006
IEEE
15 years 10 months ago
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
Tachio Terauchi, Alex Aiken
ICALP
2004
Springer
15 years 9 months ago
Coordination Mechanisms
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
George Christodoulou, Elias Koutsoupias, Akash Nan...
WCRE
2000
IEEE
15 years 8 months ago
FAMIX and XMI
Recently exchange formats have gained lots of attention. Multiple tools need to interact and/or work on the same software system. Especially there is a need to reuse parser techno...
Sander Tichelaar, Stéphane Ducasse, Serge D...
POPL
2005
ACM
16 years 4 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko