Sciweavers

276 search results - page 36 / 56
» Evaluating formal properties of feature diagram languages
Sort
View
ESSLLI
1999
Springer
15 years 10 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
POPL
1998
ACM
15 years 10 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
CAD
2008
Springer
15 years 6 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
SCP
2010
154views more  SCP 2010»
15 years 4 months ago
An algebraic foundation for automatic feature-based program synthesis
Feature-Oriented Software Development provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along differe...
Sven Apel, Christian Lengauer, Bernhard Mölle...
ICALP
2005
Springer
15 years 11 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...