2741 search results - page 363 / 549 » Engineering Mathematical Knowledge |
132
click to vote
ISSTA
2000
ACM
15 years 8 months ago
2000
ACM
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...
128
click to vote
FOSSACS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
146
click to vote
TACS
1994
Springer
15 years 8 months ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
115
click to vote
ICSE
2000
IEEE-ACM
15 years 8 months ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...
141
click to vote
PASTE
2010
ACM
15 years 6 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...