Sciweavers

3693 search results - page 568 / 739
» Splitting a Logic Program
Sort
View
TYPES
1998
Springer
14 years 15 days ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann
POPL
1997
ACM
14 years 14 days ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
PLILP
1993
Springer
14 years 11 days ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
ICECCS
2007
IEEE
129views Hardware» more  ICECCS 2007»
14 years 4 days ago
Automated Verification of Shape, Size and Bag Properties
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
ICALP
2000
Springer
13 years 12 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten