Sciweavers

1916 search results - page 329 / 384
» Reasoning with class algebra
Sort
View
KBSE
1998
IEEE
14 years 1 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
SIGIR
1998
ACM
14 years 1 months ago
A Language Modeling Approach to Information Retrieval
Abstract Models of document indexing and document retrieval have been extensively studied. The integration of these two classes of models has been the goal of several researchers b...
Jay M. Ponte, W. Bruce Croft
IEAAIE
1998
Springer
14 years 1 months ago
Managing the Usage Experience in a Library of Software Components
The users of libraries of object-oriented software components face with both a terminological and a cognitive gap. Usually, library users do not understand the vocabulary used in t...
Pedro A. González-Calero, Mercedes Gó...
CONCUR
1997
Springer
14 years 1 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 29 days ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil