Sciweavers

2162 search results - page 84 / 433
» Automated Reasoning on Feature Models
Sort
View
143
Voted
ENTCS
2008
140views more  ENTCS 2008»
15 years 3 months ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler
112
Voted
CADE
2006
Springer
16 years 4 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
139
Voted
ICFEM
2010
Springer
15 years 2 months ago
Automating Coinduction with Case Analysis
Abstract. Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its automation is highly desirable, despite the fact ...
Eugen-Ioan Goriac, Dorel Lucanu, Grigore Rosu
148
Voted
LICS
1994
IEEE
15 years 7 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
108
Voted
DLOG
2010
15 years 1 months ago
Guiding Reification in OWL through Aggregation
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
Paula Severi, José Luiz Fiadeiro, David Eks...