Sciweavers

558 search results - page 89 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
DAC
2003
ACM
14 years 8 months ago
Automatic trace analysis for logic of constraints
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...
PPDP
2000
Springer
13 years 11 months ago
Enhanced sharing analysis techniques: a comprehensive evaluation
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
WIESS
2000
13 years 9 months ago
Dynamic Memory Management with Garbage Collection for Embedded Applications
A software system can be called a safe-system with respect to memory, when it supports only strong-typing and it does not allow for the manual disposal of dynamic memory [2]. The ...
Roberto Brega, Gabrio Rivera