Sciweavers

239 search results - page 30 / 48
» Temporal Languages for Epistemic Programs
Sort
View
PADO
2001
Springer
15 years 1 months ago
Type Systems for Useless-Variable Elimination
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
Adam Fischbach, John Hannan
POS
1998
Springer
15 years 1 months ago
Java Finalize Method, Orthogonal Persistence and Transactions
Java is a popular, object oriented language that is runtime type safe. As such, it has been seen as an attractive basis for the implementation of orthogonally persistent systems b...
John N. Zigman, Stephen Blackburn
87
Voted
IFIP
2004
Springer
15 years 2 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham
PLDI
2009
ACM
15 years 2 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
AI
2004
Springer
14 years 9 months ago
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
Ken Kaneiwa