Sciweavers

332 search results - page 22 / 67
» A Direct Algorithm for Multi-valued Bounded Model Checking
Sort
View
SIGIR
2008
ACM
15 years 1 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
QEST
2007
IEEE
15 years 7 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
PUK
2000
15 years 2 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
SPIN
2007
Springer
15 years 7 months 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...
ICSE
2007
IEEE-ACM
16 years 1 months ago
Formal Software Analysis Emerging Trends in Software Model Checking
The study of methodologies and techniques to produce correct software has been active for four decades. During this period, researchers have developed and investigated a wide vari...
Matthew B. Dwyer, John Hatcliff, Robby, Corina S. ...