Rule-Based Runtime Verification

Rule-Based Runtime Verification

Cached

Download Links

by Howard Barringer, et al.

Citations:

BibTeX

@MISC{Barringer_rule-basedruntime,
    author = {Howard Barringer and et al.},
    title = {Rule-Based Runtime Verification},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

999	The temporal logic of programs - Pnueli - 1977
94	Synthesizing monitors for safety properties - Havelund, Rosu - 2002
67	The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems - Gabbay - 1989
66	Efficient selectivity and backup operators in monte-carlo tree search - Coulom
65	Runtime assurance based on formal specifications - Lee, Kannan, et al. - 1999
52	A review of game-tree pruning - Marsland - 1988
50	Refutational theorem proving using term-rewriting systems - Hsiang - 1985
48	Automata-based verification of temporal properties on running programs - Giannakopoulou, Havelund - 2001
48	Monitoring programs using rewriting - Havelund, Rosu - 2001
40	Searching for Solutions - Allis
39	The principal continuation and the killer heuristic - Akl, Newborn - 1977
30	Checking Finite Traces Using Alternating Automata - Finkbeiner, Sipma
30	Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory - Müller - 1995
28	Rijswijck, “Games solved: Now and in the future - Herik, Uiterwijk, et al. - 2002
28	The History Heuristic - Schaeffer - 1983
26	Life in the game of Go - Benson - 1976
25	MetateM: An Introduction - Barringer, Fisher, et al. - 1995
25	Go-moku solved by new search techniques - Allis, Herik, et al. - 1996
23	The Temporal Rover and the ATG - Drusinsky - 2000
22	Experiments with test case generation and runtime analysis - Artho, Drusinsky, et al. - 2003
22	Solving the game of awari using parallel retrograde analysis - Romein, Bal
21	Monitoring temporal rules combined with Time Series - Drusinsky - 2003
20	Playing it safe: Recognizing secure territories in computer Go by using static rules and search - Müller - 1997
19	Memory versus Search in Games - Breuker - 1998
16	Collecting statistics over runtime executions - Finkbeiner, Sankaranarayanan, et al.
16	Generating optimal monitors for extended regular expressions - Sen, Ros¸u - 2003
16	The graph-history interaction: on ignoring position history - Campbell - 1985
14	New advances in Alpha−Beta Searching - Schaeffer, Plaat
13	H.R.: Runtime verification of timed LTL using disjunctive normalized equation systems - Kristoffersen, Pedersen, et al. - 2003
10	Collecting and analyzing data from distributed control programs - Kortenkamp, Milam, et al. - 2001
10	Solving Nine Men’s Morris - Gasser - 1996
10	Hash tables in Cray Blitz - Nelson - 1985
8	Some Games and Machines for Playing Them - Nash - 1952
7	Null move and deep search - Donninger - 1993
6	and 3rd CAV Workshops on Runtime Verification (RV’01 - 1st - 2002
6	Replacement schemes and two-level tables - Breuker, Uiterwijk, et al. - 1996
6	A computer-assisted study of Go on - Thorp, Walden - 1972
5	Multiple probes of transposition tables - Beal, Smith - 1996
5	Searches, tree pruning and tree ordering in Go - Dyer - 1995
4	Best Play in Fanorona Leads to Draw - Schadd, Winands, et al. - 2008
4	A solution of Go on 4×4 board by game tree search program. The 4th Game - Sei, Kawashima - 2000
4	AI techniques for the game of Go - Werf - 2004
3	Solving Kalah - Irving, Donkers, et al. - 2000
3	An Introduction to Late Move Reductions. http://www.glaurungchess.com/lmr.html - Romstad - 2006
2	The rules of Go. The Go Player’s Almanac 2001 - Davies - 2001
2	Solving 8×8 Hex - Henderson, Arneson, et al. - 2009
2	Solving Connect-4 on Medium Board Sizes - Tromp - 2008
2	den (2000). The advantage of the initiative - Uiterwijk, Herik
2	Monte-Carlo Tree Search Solver. Computers and - Winands, Björnsson, et al. - 2008