1342 search results - page 91 / 269 » Ordered Programs as Abductive Systems |
STACS
1991
Springer
14 years 1 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Checkpointing techniques are usually used to secure the execution of sequential and parallel programs. However, they can also be used in order to generate automatically a...
ICSE
2000
IEEE-ACM
14 years 1 months ago
2000
IEEE-ACM
Software systems have to be flexible in order to cope with evolving requirements. However, since it is impossible to predict with certainty what future requirements will emerge, i...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...
ICFP
2010
ACM
13 years 10 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...