Sciweavers

11 search results - page 2 / 3
» The HOL Logic Extended with Quantification over Type Variabl...
Sort
View
POPL
2005
ACM
14 years 6 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna
IFM
2010
Springer
159views Formal Methods» more  IFM 2010»
13 years 4 months ago
A Logical Framework to Deal with Variability
We present a logical framework that is able to deal with variability in product family descriptions. The temporal logic MHML is based on the classical Hennessy–Milner logic with ...
Patrizia Asirelli, Maurice H. ter Beek, Alessandro...
VMCAI
2010
Springer
14 years 3 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
ISSTA
2004
ACM
13 years 11 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
ICFP
2002
ACM
14 years 5 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski