default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSorin Stratulat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Certification of Tail Recursive Bubble-Sort in Theorema and Coq. LPAR Complementary Volume 2024: 53-68- [c25]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Certification of Sorting Algorithms Using Theorema and Coq. SCSS 2024: 38-56 - 2023
- [j7]Sorin Stratulat
:
Mechanical certification of FOLID cyclic proofs. Ann. Math. Artif. Intell. 91(5): 651-673 (2023) - 2022
- [c24]Isabela Dramnesc, Erika Ábrahám, Tudor Jebelean, Gábor Kusper, Sorin Stratulat:
Experiments with Automated Reasoning in the Class. CICM 2022: 287-304 - 2021
- [b2]Sorin Stratulat:
Noetherian Induction for Computer-Assisted First-Order Reasoning. (Récurrence noethérienne pour le raisonnement de premier ordre et assisté par l'ordinateur). University of Lorraine, Nancy, France, 2021 - [c23]Sorin Stratulat:
E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning. SCSS 2021: 129-135 - 2020
- [c22]Sorin Stratulat:
SPIKE, an automatic theorem prover - revisited. SYNASC 2020: 93-96
2010 – 2019
- 2019
- [j6]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques. J. Symb. Comput. 90: 3-41 (2019) - 2018
- [c21]Sorin Stratulat:
Validating Back-links of FOLID Cyclic Pre-proofs. CL&C 2018: 39-53 - 2017
- [j5]Sorin Stratulat:
Mechanically certifying formula-based Noetherian induction reasoning. J. Symb. Comput. 80: 209-249 (2017) - [c20]Sorin Stratulat:
Cyclic Proofs with Ordering Constraints. TABLEAUX 2017: 311-327 - 2016
- [c19]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Proof-Based Synthesis of Sorting Algorithms for Trees. LATA 2016: 562-575 - [c18]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
A case study on algorithm discovery from proofs: The insert function on binary trees. SACI 2016: 231-236 - [c17]Sorin Stratulat:
Structural vs. Cyclic Induction: A Report on Some Experiments with Coq. SYNASC 2016: 29-36 - 2015
- [c16]Gabriel Michel, Véronique Jeanclaude, Sorin Stratulat:
Better Careers for Transnational European Students? - A Case Study for French-German Diploma Alumni. CISIS-ICEUTE 2015: 517-524 - [c15]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Theory exploration of binary trees. SISY 2015: 139-144 - [c14]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms. SYNASC 2015: 137-144 - 2014
- [c13]Takahito Aoto, Sorin Stratulat:
Decision Procedures for Proving Inductive Theorems without Induction. PPDP 2014: 237-248 - [c12]Sorin Stratulat:
Implementing Reasoning Modules in Implicit Induction Theorem Provers. SYNASC 2014: 133-140 - 2012
- [c11]Sorin Stratulat:
A Unified View of Induction Reasoning for First-Order Logic. Turing-100 2012: 326-352 - [c10]Amira Henaien, Sorin Stratulat:
Performing Implicit Induction Reasoning with Certifying Proof Environments. SCSS 2012: 97-108 - 2011
- [c9]Sorin Stratulat, Vincent Demange:
Automated Certification of Implicit Induction Proofs. CPP 2011: 37-53 - 2010
- [c8]Sorin Stratulat:
Integrating Implicit Induction Proofs into Certified Proof Environments. IFM 2010: 320-335
2000 – 2009
- 2008
- [c7]Sorin Stratulat:
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities. RTA 2008: 351-365 - 2007
- [c6]Sorin Stratulat:
'Descente Infinie' Induction-Based Saturation Procedures. SYNASC 2007: 17-24 - 2005
- [c5]Sorin Stratulat:
Automatic 'Descente Infinie' Induction Reasoning. TABLEAUX 2005: 262-276 - 2003
- [j4]Michaël Rusinowitch, Sorin Stratulat, Francis Klay:
Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm. J. Autom. Reason. 30(2): 53-177 (2003) - [c4]Gilles Barthe, Sorin Stratulat:
Validation of the JavaCard Platform with Implicit Induction Techniques. RTA 2003: 337-351 - 2002
- [j3]Alessandro Armando, Michaël Rusinowitch, Sorin Stratulat:
Incorporating Decision Procedures in Implicit Induction. J. Symb. Comput. 34(4): 241-258 (2002) - [c3]Abdessamad Imine, Yahya Slimani, Sorin Stratulat:
Using Automated Induxtion-based Theorem Provers for Reasoning about Concurrent Systems. JFPLC 2002: 71- - 2001
- [j2]Sorin Stratulat:
A General Framework to Build Contextual Cover Set Induction Provers. J. Symb. Comput. 32(4): 403-445 (2001) - 2000
- [b1]Sorin Stratulat:
Preuves par récurrence avec ensembles couvrants contextuels. Application à la vérification de logiciels de télécommunications. Henri Poincaré University, Nancy, France, 2000 - [c2]Michaël Rusinowitch, Sorin Stratulat, Francis Klay:
Mechanical Verification of an Ideal Incremental ABR Conformance. CAV 2000: 344-357
1990 – 1999
- 1995
- [j1]Sorin Stratulat, David J. Evans:
Virtual Shared Memory Machines - an Application of PVM. Parallel Algorithms Appl. 7(1-2): 143-160 (1995) - 1994
- [c1]Cornell Popa, Yonut Lopatan, Sorin Stratulat:
Logic, Prolog, and Legal Sentence. ICLP Workshop: Legal Application of Logic Programming 1994
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 2024-09-06 00:40 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:
