Nora Szasz
Nora Szasz
Verified email at ort.edu.uy
Title
Cited by
Cited by
Year
Verification of model transformations: A survey of the state-of-the-art
D Calegari, N Szasz
Electronic notes in theoretical computer science 292, 5-25, 2013
632013
A type-theoretic framework for certified model transformations
D Calegari, C Luna, N Szasz, Á Tasistro
Brazilian Symposium on Formal Methods, 112-127, 2010
452010
Statecharts and Variabilities.
N Szasz, P Vilanova
VaMoS, 131-140, 2008
172008
UML 2.0 interactions with OCL/RT constraints
DC García, MV Cengarle, N Szasz
2008 Forum on Specification, Verification and Design Languages, 167-172, 2008
162008
Studies of a theory of specifications with built-in program extraction
P Severi, N Szasz
Journal of Automated Reasoning 27 (1), 61-87, 2001
152001
Dependent types for nominal terms with atom substitutions
E Fairweather, M Fernández, N Szasz, A Tasistro
13th International Conference on Typed Lambda Calculi and Applications (TLCA …, 2015
122015
Alpha-structural induction and recursion for the lambda calculus in constructive type theory
E Copello, Á Tasistro, N Szasz, A Bove, M Fernández
Electronic Notes in Theoretical Computer Science 323, 109-124, 2016
102016
Automatic Derivation of Behavior of Products in a Software Product Line
A González, C Luna, F Zorzan, N Szasz
IEEE Latin America Transactions 12 (6), 1120-1126, 2014
92014
Heterogeneous verification in the context of model driven engineering
D Calegari, T Mossakowski, N Szasz
Science of Computer Programming 126, 3-30, 2016
72016
Specification of a smart card operating system
G Betarte, C Cornes, N Szasz, A Tasistro
International Workshop on Types for Proofs and Programs, 77-93, 1999
71999
Institution-based semantics for MOF and QVT-Relations
D Calegari, N Szasz
Brazilian Symposium on Formal Methods, 34-50, 2013
62013
Experiment with a type-theoretic approach to the verification of model transformations
D Calegari, C Luna, N Szasz, Á Tasistro
Universidad ORT Uruguay. Facultad de Ingeniería, 2009
62009
A Machine Checked Proof that Ackermann’s Function is not Primitive
N Szasz
Logical Environments, 317, 1993
61993
A machine checked proof that Ackermann's function is not primitive recursive
N Szasz
SECOND WORKSHOP ON LOGICAL FRAMEWORKS, 343, 1991
61991
Formal metatheory of the Lambda calculus using Stoughton's substitution
E Copello, N Szasz, Á Tasistro
Theoretical Computer Science 685, 65-82, 2017
52017
Bridging Technological Spaces for the Verification of Model Transformations.
D Calegari, N Szasz
CIbSE, 43-56, 2013
52013
Principal type scheme for session types
A Tasistro, E Copello, N Szasz
Int. J. Logic Comput 3 (1), 34-43, 2012
52012
A theory of specifications, programs and proofs
N Szasz
Chalmers University of Technology, Department of Computing Science, 1997
51997
A Machine Checked Proof that Ackermann’s Function is not Primitive Recursive. Licentiate Thesis, Chalmers University of Technology and University of Göteborg, Sweden, June 1991 …
N Szasz
Cambridge University Press, 0
5
Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders
E Copello, N Szasz, Á Tasistro
arXiv preprint arXiv:1807.01870, 2018
42018
The system can't perform the operation now. Try again later.
Articles 1–20