Sciweavers

1157 search results - page 64 / 232
» Descriptive Complexity and Model Checking
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 10 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
IANDC
2011
127views more  IANDC 2011»
13 years 5 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
ICSE
2007
IEEE-ACM
14 years 10 months ago
Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset
Many architecture description languages (ADLs) have been proposed to model, analyze, configure, and deploy complex software systems. To face this diversity, extensible ADLs (or AD...
Ali Erdem Özcan, Jean-Bernard Stefani, Matthi...
JLP
2006
126views more  JLP 2006»
13 years 10 months ago
Compositional modeling and refinement for hierarchical hybrid systems
In this paper, we develop a theory of modular design and refinement of hierarchical hybrid systems. In particular, we present compositional trace-based semantics for the language ...
Rajeev Alur, Radu Grosu, Insup Lee, Oleg Sokolsky
JAIR
2007
146views more  JAIR 2007»
13 years 10 months ago
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....