Paul Gastin
International Conference on Computer Aided Verification · 2001
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 5 researchers here, as inferred from the citation graph.
Whom Paul Gastin trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Paul Gastin overall
- Marius Kloetzer
- Andreas Klaus Bauer
- Michael R. Clarkson
- Calin A. Belta
- Martin Leucker
- Patrick Heymans
- Florent Kirchner
- Bernd Finkbeiner
- Christian Schallhart
Papers from Paul Gastin's perspective
Ordered by how strongly the researchers Paul Gastin trusts endorse each paper. Same corpus, a different order for every researcher.
- Optimizing Büchi Automata (International Conference on Concurrency Theory)
- Efficient Büchi Automata from LTL Formulae (International Conference on Computer Aided Verification)
- Minimization of Boolean Functions
- The unified modeling language reference manual
- The complexity of computing a Nash equilibrium
- Dynamic logic (SIGA)
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations (JACM)
- Non-Cooperative Games
- Relating Probabilistic Grammars and Automata
- An axiomatic basis for computer programming
Their papers
- Fast LTL to Büchi Automata Translation (2001) — 767 citations