Sciweavers

55 search results - page 6 / 11
» Relational Reasoning for Recursive Types and References
Sort
View
LPAR
2010
Springer
13 years 5 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
LICS
2006
IEEE
14 years 1 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
POPL
2008
ACM
14 years 7 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
NMR
2004
Springer
14 years 24 days ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic
SEMWEB
2007
Springer
14 years 1 months ago
Performance of Hybrid WSML Service Matching with WSMO-MX: Preliminary Results
Abstract. The WSMO-MX matchmaker applies different matching filters to retrieve WSMO-oriented service descriptions that are semantically relevant to a given query with respect to...
Frank Kaufer, Matthias Klusch