Sciweavers

79 search results - page 13 / 16
» Verifying Reference Counting Implementations
Sort
View
FIW
2009
134views Communications» more  FIW 2009»
13 years 4 months ago
Feature Diagrams for Change-Oriented Programming
Abstract. The idea of feature-oriented programming is to map requirements to features, concepts that can be composed to form a software product. Change-oriented programming (ChOP),...
Peter Ebraert, Andreas Classen, Patrick Heymans, T...
STTT
2010
120views more  STTT 2010»
13 years 1 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 8 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
POPL
2010
ACM
14 years 4 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
OOPSLA
2007
Springer
14 years 1 months ago
Modular typestate checking of aliased objects
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
Kevin Bierhoff, Jonathan Aldrich