default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranck van Breugel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Elena Sherman, Yannic Noller, Cyrille Artho, Franck van Breugel, Anto Nanah Ji, John Kellerman, Parssa Khazra, Filip Kliber, Gaurang Kudale, Pavel Parízek, Corina S. Pasareanu, Ron Pressler, Matt Walker, Hongru Wang, Qiuchen Yan:
The Java Pathfinder Workshop 2022. ACM SIGSOFT Softw. Eng. Notes 48(1): 19-21 (2023)- [j17]Matt Walker, Parssa Khazra, Anto Nanah Ji, Hongru Wang, Franck van Breugel:
jpf-logic: a Framework for Checking Temporal Logic Properties of Java Code. ACM SIGSOFT Softw. Eng. Notes 48(1): 32-36 (2023) - [c34]Amgad Rady, Franck van Breugel:
Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains. FoSSaCS 2023: 285-307 - 2021
- [j16]Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. Log. Methods Comput. Sci. 17(1) (2021) - [c33]Syyeda Zainab Fatmi
, Xiang Chen, Yash Dhamija, Maeve Wildes, Qiyi Tang, Franck van Breugel:
Probabilistic Model Checking of Randomized Java Code. SPIN 2021: 157-174 - 2020
- [j15]Qiyi Tang, Franck van Breugel:
Deciding probabilistic bisimilarity distance one for probabilistic automata. J. Comput. Syst. Sci. 111: 57-84 (2020)
2010 – 2019
- 2019
- [c32]Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. CONCUR 2019: 9:1-9:17 - [i2]Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. CoRR abs/1907.01768 (2019) - 2018
- [c31]Qiyi Tang, Franck van Breugel:
Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains. CAV (1) 2018: 681-699 - [c30]Qiyi Tang, Franck van Breugel:
Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata. CONCUR 2018: 9:1-9:17 - 2017
- [j14]Franck van Breugel:
Probabilistic bisimilarity distances. ACM SIGLOG News 4(4): 33-51 (2017) - [c29]Qiyi Tang, Franck van Breugel:
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains. CONCUR 2017: 27:1-27:16 - [c28]Ben Spencer, Michael Benedikt, Anders Møller, Franck van Breugel:
ArtForm: a tool for exploring the codebase of form-based websites. ISSTA 2017: 380-383 - 2016
- [c27]Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances via Policy Iteration. CONCUR 2016: 22:1-22:15 - 2014
- [c26]Franck van Breugel, James Worrell:
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata. Horizons of the Mind 2014: 191-213 - [c25]Nastaran Shafiei, Franck van Breugel:
Automatic handling of native methods in Java PathFinder. SPIN 2014: 97-100 - [e3]Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten:
Horizons of the Mind. A Tribute to Prakash Panangaden - Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 8464, Springer 2014, ISBN 978-3-319-06879-4 [contents] - 2013
- [j13]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163]. Theor. Comput. Sci. 492: 117-122 (2013) - [c24]Nastaran Shafiei, Franck van Breugel:
Towards model checking of computer games with Java PathFinder. GAS@ICSE 2013: 15-21 - 2012
- [j12]Franck van Breugel:
On behavioural pseudometrics and closure ordinals. Inf. Process. Lett. 112(19): 715-718 (2012) - [c23]Di Chen, Franck van Breugel, James Worrell:
On the Complexity of Computing Probabilistic Bisimilarity. FoSSaCS 2012: 437-451 - [c22]Elise Cormie-Bowins, Franck van Breugel:
Measuring Progress of Probabilistic LTL Model Checking. QAPL 2012: 33-47 - 2011
- [c21]Xin Zhang, Franck van Breugel:
A Progress Measure for Explicit-State Probabilistic Model-Checkers. ICALP (2) 2011: 283-294 - 2010
- [j11]Franck van Breugel, Marsha Chechik:
19th International Conference on Concurrency Theory. Inf. Comput. 208(10): 1091-1092 (2010) - [c20]Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel:
Non-blocking binary search trees. PODC 2010: 131-140 - [c19]Xin Zhang, Franck van Breugel:
Model Checking Randomized Algorithms with Java PathFinder. QEST 2010: 157-158
2000 – 2009
- 2008
- [j10]Franck van Breugel, Babita Sharma, James Worrell:
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems. Log. Methods Comput. Sci. 4(2) (2008) - [e2]Franck van Breugel, Marsha Chechik:
CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings. Lecture Notes in Computer Science 5201, Springer 2008, ISBN 978-3-540-85360-2 [contents] - [i1]Franck van Breugel, Babita Sharma, James Worrell:
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems. CoRR abs/0803.3796 (2008) - 2007
- [j9]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
Recursively defined metric spaces without contraction. Theor. Comput. Sci. 380(1-2): 143-163 (2007) - [c18]Franck van Breugel, Babita Sharma, James Worrell:
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. FoSSaCS 2007: 123-137 - [c17]Alessandro Aldini, Franck van Breugel:
Preface. QAPL 2007: 1-2 - [e1]Alessandro Aldini, Franck van Breugel:
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages, QAPL 2007, Braga, Portugal, March 24-25, 2007. Electronic Notes in Theoretical Computer Science 190(3), Elsevier 2007 [contents] - 2006
- [j8]Franck van Breugel, James Worrell:
Approximating and computing behavioural distances in probabilistic transition systems. Theor. Comput. Sci. 360(1-3): 373-385 (2006) - 2005
- [j7]Franck van Breugel, James Worrell:
A behavioural pseudometric for probabilistic transition systems. Theor. Comput. Sci. 331(1): 115-142 (2005) - [j6]Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell:
Domain theory, testing and simulation for labelled Markov processes. Theor. Comput. Sci. 333(1-2): 171-197 (2005) - [c16]Franck van Breugel, Mariya Koshkina:
Dead-Path-Elimination in BPEL4WS. ACSD 2005: 192-201 - [c15]Franck van Breugel:
A Behavioural Pseudometric for Metric Labelled Transition Systems. CONCUR 2005: 141-155 - [c14]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
An Accessible Approach to Behavioural Pseudometrics. ICALP 2005: 1018-1030 - 2004
- [j5]Franck van Breugel:
De Bakker-Zucker processes revisited. Inf. Comput. 188(1): 68-76 (2004) - [j4]Mariya Koshkina, Franck van Breugel:
Modelling and verifying web service orchestration by means of the concurrency workbench. ACM SIGSOFT Softw. Eng. Notes 29(5): 1-10 (2004) - 2003
- [c13]Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell:
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215 - 2002
- [c12]Franck van Breugel, Steven Shalit, James Worrell:
Testing Labelled Markov Processes. ICALP 2002: 537-548 - 2001
- [j3]Franck van Breugel:
An introduction to metric semantics: operational and denotational models for programming and specification languages. Theor. Comput. Sci. 258(1-2): 1-98 (2001) - [c11]Franck van Breugel, James Worrell:
An Algorithm for Quantitative Verification of Probabilistic Transition Systems. CONCUR 2001: 336-350 - [c10]Franck van Breugel, James Worrell:
Towards Quantitative Verification of Probabilistic Transition Systems. ICALP 2001: 421-432 - 2000
- [c9]Jaco de Bakker, Franck van Breugel:
From Banach to Milner: metric semantics for second order communication and concurrency. Proof, Language, and Interaction 2000: 99-132
1990 – 1999
- 1999
- [c8]Franck van Breugel, Stephen Watson:
A Note on Hyperspaces and Terminal Coalgebras. CMCS 1999: 201-208 - 1998
- [b1]Franck van Breugel:
Comparative metric semantics of programming languages - nondeterminism and recursion. Progress in theoretical computer science, Birkhäuser 1998, ISBN 978-3-7643-3927-2, pp. I-XIX, 1-220 - [j2]Marcello M. Bonsangue, Franck van Breugel, Jan J. M. M. Rutten:
Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. Theor. Comput. Sci. 193(1-2): 1-51 (1998) - [j1]Franck van Breugel:
Terminal Metric Spaces of Finitely Branching and Image Finite Linear Processes. Theor. Comput. Sci. 202(1-2): 223-230 (1998) - 1997
- [c7]Franck van Breugel:
A Labelled Transition Systems for pi-epsilon-Calculus. TAPSOFT 1997: 321-332 - [c6]Franck van Breugel:
Failures, finiteness and full abstraction. MFPS 1997: 391-408 - 1994
- [c5]Franck van Breugel:
Generalized Finiteness Conditions of Labelled Transition Systems. ICALP 1994: 376-387 - 1993
- [c4]J. W. de Bakker, Franck van Breugel, Arie de Bruin:
Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands. MFCS 1993: 252-261 - [c3]Franck van Breugel:
Three Metric Domains of Processes for Bisimulation. MFPS 1993: 103-121 - [c2]J. W. de Bakker, Franck van Breugel:
Topological Models for Higher Ordr Control Flow. MFPS 1993: 122-142 - 1991
- [c1]Franck van Breugel:
Comparative Semantics for a Real-Time Programming Language with Integration. TAPSOFT, Vol.1 1991: 397-411
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
