default search action
Marco B. Caminati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Marco B. Caminati
:
O2 is a Multiple Context-Free Grammar: An Implementation-, Formalisation-Friendly Proof. DLT 2024: 82-97 - [i11]Marco B. Caminati:
O2 is a multiple context-free grammar: an implementation-, formalisation-friendly proof. CoRR abs/2405.09396 (2024) - 2023
- [c12]Marco B. Caminati, Juliana Küster Filipe Bowles
Representation Theorems Obtained by Mining across Web Sources for Hints. ICICT 2023: 203-210 - [c11]Marco B. Caminati
Isabelle Formalisation of Original Representation Theorems. CICM 2023: 98-112 - [i10]Marco B. Caminati, Juliana Küster Filipe Bowles:
Representation Theorems Obtained by Miningacross Web Sources for Hints. CoRR abs/2306.00584 (2023) - [i9]Marco B. Caminati:
Isabelle Formalisation of Original Representation Theorems. CoRR abs/2306.10558 (2023) - 2020
- [j11]Juliana Küster Filipe Bowles
Correct composition in the presence of behavioural conflicts and dephasing. Sci. Comput. Program. 185 (2020) - [c10]Juliana Küster Filipe Bowles, Marco B. Caminati:
A Formally Verified SMT Approach to True Concurrency. CILC 2020: 357-371
2010 – 2019
- 2019
- [j10]Juliana Bowles
A framework for automated conflict detection and resolution in medical guidelines. Sci. Comput. Program. 182: 42-63 (2019) - [c9]Juliana Bowles
An Integrated Approach to a Combinatorial Optimisation Problem. IFM 2019: 284-302 - [p1]Juliana Küster Filipe Bowles
Balancing Prescriptions with Constraint Solvers. Automated Reasoning for Systems Biology and Medicine 2019: 243-267 - 2017
- [c8]Juliana Bowles
Correct Composition of Dephased Behavioural Models. FACS 2017: 233-250 - [c7]Juliana Küster Filipe Bowles
A Flexible Approach for Finding Optimal Paths with Minimal Conflicts. ICFEM 2017: 209-225 - [c6]Juliana Bowles
A Verified Algorithm Enumerating Event Structures. CICM 2017: 239-254 - [c5]Juliana Bowles
An integrated framework for verifying multiple care pathways. TASE 2017: 1-8 - [i8]Juliana Bowles, Marco B. Caminati:
A Verified Algorithm Enumerating Event Structures. CoRR abs/1705.07228 (2017) - [i7]Juliana Bowles, Marco B. Caminati:
A Flexible Approach for Finding Optimal Paths with Minimal Conflicts. CoRR abs/1707.05383 (2017) - [i6]Juliana Bowles, Marco B. Caminati:
Correct Composition of Dephased Behavioural Models. CoRR abs/1707.09646 (2017) - 2016
- [c4]Juliana Küster Filipe Bowles
Mind the Gap: Addressing Behavioural Inconsistencies with Formal Methods. APSEC 2016: 313-320 - 2015
- [j9]Marco B. Caminati, Manfred Kerber, Christoph Lange, Colin Rowat:
VCG - Combinatorial Vickrey-Clarke-Groves Auctions. Arch. Formal Proofs 2015 (2015) - [c3]Marco B. Caminati
Sound Auction Specification and Implementation. EC 2015: 547-564 - 2014
- [j8]Marco B. Caminati, Artur Kornilowicz
Pseudo-Canonical Formulae are Classical. Formaliz. Math. 22(2): 99-103 (2014) - [c2]Marco B. Caminati, Manfred Kerber, Christoph Lange
Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? CICM 2014: 236-251 - [i5]Marco B. Caminati, Manfred Kerber, Christoph Lange, Colin Rowat:
Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? CoRR abs/1406.0774 (2014) - [i4]Marco B. Caminati, Manfred Kerber, Colin Rowat:
Budget Imbalance Criteria for Auctions: A Formalized Theorem. CoRR abs/1412.0542 (2014) - 2013
- [j7]Marco B. Caminati, Giuseppe Rosolini:
Custom Automations in Mizar. J. Autom. Reason. 50(2): 147-160 (2013) - [c1]Christoph Lange
A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory. MKM/Calculemus/DML 2013: 200-215 - [i3]Christoph Lange, Marco B. Caminati, Manfred Kerber, Till Mossakowski, Colin Rowat, Makarius Wenzel, Wolfgang Windsteiger:
A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory. CoRR abs/1303.4193 (2013) - [i2]Marco B. Caminati, Manfred Kerber, Christoph Lange, Colin Rowat:
Proving soundness of combinatorial Vickrey auctions and generating verified executable code. CoRR abs/1308.1779 (2013) - 2012
- [i1]Marco B. Caminati:
A simplified framework for first-order languages and its formalization in Mizar. CoRR abs/1205.4316 (2012) - 2011
- [j6]Marco B. Caminati:
Preliminaries to Classical First Order Model Theory. Formaliz. Math. 19(3): 155-167 (2011) - [j5]Marco B. Caminati:
Definition of First Order Language with Arbitrary Alphabet. Syntax of Terms, Atomic Formulas and their Subterms. Formaliz. Math. 19(3): 169-178 (2011) - [j4]Marco B. Caminati:
First Order Languages: Further Syntax and Semantics. Formaliz. Math. 19(3): 179-192 (2011) - [j3]Marco B. Caminati:
Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages. Formaliz. Math. 19(3): 193-203 (2011) - [j2]Marco B. Caminati:
Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem. Formaliz. Math. 19(3): 205-222 (2011) - 2010
- [j1]Marco B. Caminati:
Basic first-order model theory in Mizar. J. Formaliz. Reason. 3(1): 49-77 (2010)
Coauthor Index
aka: Juliana Bowles
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 2024-08-23 18:32 CEST 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: