Sciweavers

100 search results - page 18 / 20
» Linear-Time Model Checking: Automata Theory in Practice
Sort
View
91
Voted
POPL
1990
ACM
15 years 2 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
KBSE
1998
IEEE
15 years 2 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
DGO
2008
135views Education» more  DGO 2008»
14 years 11 months ago
Florida Public Hurricane Loss Model (FPHLM): research experience in system integration
The Florida Public Hurricane Loss Model (FPHLM) developed in the State of Florida offers an open, public and effective tool for the government to regulate the insurance ratemaking...
Shu-Ching Chen, Min Chen, Na Zhao, Shahid Hamid, K...
KBSE
2010
IEEE
14 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
91
Voted
HYBRID
2010
Springer
15 years 4 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...