default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRazvan Diaconescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]Razvan Diaconescu:
Translation structures for fuzzy model theory. Fuzzy Sets Syst. 480: 108866 (2024)- [i4]Razvan Diaconescu:
Computational Modelling for Combinatorial Game Strategies. CoRR abs/2408.03955 (2024) - 2023
- [j52]Razvan Diaconescu:
Partialising Institutions. Appl. Categorical Struct. 31(6): 46 (2023) - [j51]Razvan Diaconescu:
Preservation in many-valued truth institutions. Fuzzy Sets Syst. 456: 38-71 (2023) - [j50]Razvan Diaconescu
:
Generalised graded interpolation. Int. J. Approx. Reason. 152: 236-261 (2023) - [j49]Razvan Diaconescu:
Decompositions of stratified institutions. J. Log. Comput. 33(7): 1625-1664 (2023) - 2022
- [j48]Razvan Diaconescu:
Permutation Groups Generated by γ-Cycles. Axioms 11(10): 528 (2022) - [i3]Razvan Diaconescu:
Non-determinsitic algebraic rewriting as adjunction. CoRR abs/2204.12133 (2022) - 2021
- [i2]Razvan Diaconescu:
Decompositions of Stratified Institutions. CoRR abs/2112.12993 (2021) - 2020
- [j47]Razvan Diaconescu:
Introducing H, an Institution-Based Formal Specification and Verification Language. Logica Universalis 14(2): 259-277 (2020)
2010 – 2019
- 2019
- [j46]Till Mossakowski, Razvan Diaconescu, Martin Glauer:
Towards Fuzzy Neural Conceptors. FLAP 6(4): 725-744 (2019) - [i1]Razvan Diaconescu:
Introducing H, an institution-based formal specification and verification language. CoRR abs/1908.09868 (2019) - 2017
- [j45]Razvan Diaconescu:
Implicit Kripke semantics and ultraproducts in stratified institutions. J. Log. Comput. 27(5): 1577-1606 (2017) - [j44]Razvan Diaconescu:
Universal logic and computation. J. Log. Comput. 27(6): 1677-1678 (2017) - 2016
- [j43]Razvan Diaconescu:
Quasi-varieties and initial semantics for hybridized institutions. J. Log. Comput. 26(3): 855-891 (2016) - [j42]Razvan Diaconescu, Alexandre Madeira:
Encoding hybridized institutions into first-order logic. Math. Struct. Comput. Sci. 26(5): 745-788 (2016) - [j41]Razvan Diaconescu:
Functorial semantics of first-order views. Theor. Comput. Sci. 656: 46-59 (2016) - 2015
- [j40]Razvan Diaconescu:
Structuring of Specification Modules (extended). Comput. Sci. J. Moldova 23(2): 135-152 (2015) - [j39]Razvan Diaconescu:
On the existence of translations of structured specifications. Inf. Process. Lett. 115(1): 15-22 (2015) - [e1]Mihai Codescu, Razvan Diaconescu, Ionut Tutu:
Recent Trends in Algebraic Development Techniques - 22nd International Workshop, WADT 2014, Sinaia, Romania, September 4-7, 2014, Revised Selected Papers. Lecture Notes in Computer Science 9463, Springer 2015, ISBN 978-3-319-28113-1 [contents] - 2014
- [j38]Razvan Diaconescu, Ionut Tutu:
Foundations for structuring behavioural specifications. J. Log. Algebraic Methods Program. 83(3-4): 319-338 (2014) - [j37]Razvan Diaconescu, Till Mossakowski, Andrzej Tarlecki:
The Institution-Theoretic Scope of Logic Theorems. Logica Universalis 8(3-4): 393-406 (2014) - [j36]Razvan Diaconescu:
Graded consequence: an institution theoretic study. Soft Comput. 18(7): 1247-1267 (2014) - [c11]Razvan Diaconescu:
CafeOBJ Traces. Specification, Algebra, and Software 2014: 53-65 - [c10]Razvan Diaconescu:
From Universal Logic to Computer Science, and Back. ICTAC 2014: 1-16 - 2013
- [j35]Razvan Diaconescu:
Institutional semantics for many-valued logics. Fuzzy Sets Syst. 218: 32-52 (2013) - 2012
- [j34]Razvan Diaconescu:
Borrowing interpolation. J. Log. Comput. 22(3): 561-586 (2012) - [j33]Razvan Diaconescu:
Interpolation for predefined types. Math. Struct. Comput. Sci. 22(1): 1-24 (2012) - [j32]Razvan Diaconescu:
An axiomatic approach to structuring specifications. Theor. Comput. Sci. 433: 20-42 (2012) - 2011
- [j31]Razvan Diaconescu:
Grothendieck Inclusion Systems. Appl. Categorical Struct. 19(5): 783-802 (2011) - [j30]Razvan Diaconescu:
Coinduction for preordered algebra. Inf. Comput. 209(2): 108-117 (2011) - [j29]Razvan Diaconescu:
Structural induction in institutions. Inf. Comput. 209(9): 1197-1222 (2011) - [j28]Razvan Diaconescu:
On quasi-varieties of multiple valued logic models. Math. Log. Q. 57(2): 194-203 (2011) - [j27]Razvan Diaconescu, Ionut Tutu:
On the algebra of structured specifications. Theor. Comput. Sci. 412(28): 3145-3174 (2011) - [c9]Manuel A. Martins, Alexandre Madeira, Razvan Diaconescu, Luís Soares Barbosa:
Hybridization of Institutions. CALCO 2011: 283-297 - 2010
- [j26]Razvan Diaconescu, Marius Petria:
Saturated models in institutions. Arch. Math. Log. 49(6): 693-723 (2010) - [j25]Razvan Diaconescu:
Quasi-boolean encodings and conditionals in algebraic specification. J. Log. Algebraic Methods Program. 79(2): 174-188 (2010)
2000 – 2009
- 2009
- [j24]Razvan Diaconescu:
An encoding of partial algebras as total algebras. Inf. Process. Lett. 109(23-24): 1245-1251 (2009) - [j23]Till Mossakowski, Razvan Diaconescu, Andrzej Tarlecki:
What is a Logic Translation? Logica Universalis 3(1): 95-124 (2009) - 2008
- [j22]Razvan Diaconescu:
A categorical study on the finiteness of specifications. Inf. Process. Lett. 108(2): 75-80 (2008) - 2007
- [j21]Marc Aiguier, Razvan Diaconescu:
Stratified institutions and elementary homomorphisms. Inf. Process. Lett. 103(1): 5-13 (2007) - [j20]Razvan Diaconescu, Petros S. Stefaneas:
Ultraproducts and possible worlds semantics in institutions. Theor. Comput. Sci. 379(1-2): 210-230 (2007) - 2006
- [j19]Razvan Diaconescu, Marius Petria:
Abstract Beth definability in institutions. J. Symb. Log. 71(3): 1002-1028 (2006) - [j18]Razvan Diaconescu:
Proof Systems for Institutional Logic. J. Log. Comput. 16(3): 339-357 (2006) - [c8]Razvan Diaconescu:
Jewels of Institution-Independent Model Theory. Essays Dedicated to Joseph A. Goguen 2006: 65-98 - 2005
- [j17]Razvan Diaconescu:
Behavioural specification for hierarchical object composition. Theor. Comput. Sci. 343(3): 305-331 (2005) - 2004
- [j16]Razvan Diaconescu:
Herbrand theorems in arbitrary institutions. Inf. Process. Lett. 90(1): 29-37 (2004) - [j15]Razvan Diaconescu:
Elementary Diagrams in Institutions. J. Log. Comput. 14(5): 651-674 (2004) - [j14]Razvan Diaconescu:
An Institution-independent Proof of Craig Interpolation Theorem. Stud Logica 77(1): 59-79 (2004) - [j13]Razvan Diaconescu:
Interpolation in Grothendieck Institutions. Theor. Comput. Sci. 311(1-3): 439-461 (2004) - 2003
- [j12]Razvan Diaconescu, Kokichi Futatsugi, Kazuhiro Ogata:
CafeOBJ: Logical Foundations and Methodologies. Comput. Artif. Intell. 22(3-4): 257-283 (2003) - [j11]Razvan Diaconescu:
Institution-independent Ultraproducts. Fundam. Informaticae 55(3-4): 321-348 (2003) - [c7]Razvan Diaconescu:
Behavioural Specification for Hierarchical Object Composition. FMCO 2003: 134-156 - 2002
- [j10]Razvan Diaconescu:
Grothendieck Institutions. Appl. Categorical Struct. 10(4): 383-402 (2002) - [j9]Razvan Diaconescu, Kokichi Futatsugi:
Logical foundations of CafeOBJ. Theor. Comput. Sci. 285(2): 289-318 (2002) - 2000
- [j8]Razvan Diaconescu, Kokichi Futatsugi:
Behavioural Coherence in Object-Oriented Algebraic Specification. J. Univers. Comput. Sci. 6(1): 74-96 (2000) - [j7]Razvan Diaconescu:
Category-based constraint logic. Math. Struct. Comput. Sci. 10(3): 373-407 (2000)
1990 – 1999
- 1999
- [c6]Razvan Diaconescu, Kokichi Futatsugi, Shusaku Iida:
Component-Based Algebraic Specification and Verification in CafeOBJ. World Congress on Formal Methods 1999: 1644-1663 - [p2]Shusaku Iida, Kokichi Futatsugi, Razvan Diaconescu:
Component-Based Algebraic Specification. Behavioral Specifications of Businesses and Systems 1999: 105-121 - 1998
- [b1]Razvan Diaconescu, Kokichi Futatsugi:
Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST Series in Computing 6, World Scientific 1998, ISBN 978-981-02-3513-0, pp. 1-196 - [j6]Razvan Diaconescu:
Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages. Appl. Categorical Struct. 6(4): 427-453 (1998) - [c5]Razvan Diaconescu, Kokichi Futatsugi:
An overview of CafeOBJ. WRLA 1998: 285-298 - 1996
- [j5]Razvan Diaconescu:
Category-Based Modularisation for Equational Logic Programming. Acta Informatica 33(5): 477-510 (1996) - [c4]Razvan Diaconescu:
Foundations of behavioural specification in rewriting logic. WRLA 1996: 226-245 - 1995
- [j4]Razvan Diaconescu:
Completeness of Category-Based Equational Deduction. Math. Struct. Comput. Sci. 5(1): 9-40 (1995) - [c3]Joseph A. Goguen, Razvan Diaconescu:
An Introduction to Category-based Equational Logic. AMAST 1995: 91-126 - [c2]Razvan Diaconescu:
A Category-Based Equational Logic Semantics to Constraint Programming. COMPASS/ADT 1995: 200-221 - 1994
- [j3]Joseph A. Goguen, Razvan Diaconescu:
An Oxford Survey of Order Sorted Algebra. Math. Struct. Comput. Sci. 4(3): 363-392 (1994) - 1993
- [p1]Joseph A. Goguen, Razvan Diaconescu:
A Short Oxford Survey of Order Sorted Algebra. Current Trends in Theoretical Computer Science 1993: 209-222 - 1992
- [j2]Joseph A. Goguen, Razvan Diaconescu:
A short Oxford survey of order sorted algebra.. Bull. EATCS 48: 121-133 (1992) - [j1]Razvan Diaconescu:
Contraction Algebras and Unification of (Infinite) Terms. J. Comput. Syst. Sci. 44(1): 23-42 (1992) - [c1]Joseph A. Goguen, Razvan Diaconescu:
Towards an Algebraic Semantics for the Object Paradigm. COMPASS/ADT 1992: 1-29
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-15 00:42 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:
