Sciweavers

8196 search results - page 415 / 1640
» Computational Modeling and Complexity Science
Sort
View
SPIN
2007
Springer
16 years 27 days ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
SPIN
2005
Springer
16 years 8 days ago
Etch: An Enhanced Type Checking Tool for Promela
We present ETCH, an enhanced type checking tool for the Promela language. This tool uses standard type checking in conjunction with constraint-based type inference to detect type e...
Alastair F. Donaldson, Simon J. Gay
GG
2004
Springer
16 years 5 days ago
Event-Driven Grammars: Towards the Integration of Meta-modelling and Graph Transformation
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these g...
Esther Guerra, Juan de Lara
165
Voted
ICMT
2010
Springer
15 years 11 months ago
Improving Higher-Order Transformations Support in ATL
Abstract. In Model-Driven Engineering (MDE), Higher-Order Transformations (HOTs) are model transformations that analyze, produce or manipulate other model transformations. In a pre...
Massimo Tisi, Jordi Cabot, Frédéric ...
FOCS
2000
IEEE
15 years 11 months ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor