Sciweavers

408 search results - page 54 / 82
» On Formal Requirements Modeling Languages: RML Revisited
Sort
View
ACL
1997
13 years 9 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
FMSD
2008
110views more  FMSD 2008»
13 years 7 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
14 years 2 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
SIGSOFT
2007
ACM
14 years 8 months ago
SLEDE: lightweight verification of sensor network security protocol implementations
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
Youssef Hanna
SAC
2009
ACM
14 years 2 months ago
Applying Reo to service coordination in long-running business transactions
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of serviceoriented computing. Transactions in this context may ...
Natallia Kokash, Farhad Arbab