Sciweavers

333 search results - page 45 / 67
» On the complexity of partial order trace model checking
Sort
View
DLOG
2009
13 years 5 months ago
Explaining by Example: Model Exploration for Ontology Comprehension
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...
Johannes Bauer, Ulrike Sattler, Bijan Parsia
FM
2008
Springer
152views Formal Methods» more  FM 2008»
13 years 9 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
SIGSOFT
2009
ACM
14 years 8 months ago
Supporting automatic model inconsistency fixing
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
Yingfei Xiong, Zhenjiang Hu, Haiyan Zhao, Hui Song...
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
SAC
2005
ACM
14 years 1 months ago
Performance analysis framework for large software-intensive systems with a message passing paradigm
The launch of new features for mobile phones is increasing and the product life cycle symmetrically decreasing in duration as higher levels of sophistication are reached. Therefor...
Christian Del Rosso