Nora Szasz
Nora Szasz
Verified email at
Cited by
Cited by
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
A type-theoretic framework for certified model transformations
D Calegari, C Luna, N Szasz, Á Tasistro
Brazilian Symposium on Formal Methods, 112-127, 2010
Statecharts and Variabilities.
N Szasz, P Vilanova
VaMoS, 131-140, 2008
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
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
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
Machine-checked proof of the Church-Rosser Theorem for the Lambda Calculus Using the Barendregt variable convention in constructive type theory
E Copello, N Szasz, Á Tasistro
Electronic Notes in Theoretical Computer Science 338, 79-95, 2018
Studies of a theory of specifications with built-in program extraction
P Severi, N Szasz
Journal of Automated Reasoning 27 (1), 61-87, 2001
Heterogeneous verification in the context of model driven engineering
D Calegari, T Mossakowski, N Szasz
Science of Computer Programming 126, 3-30, 2016
Formal metatheory of the Lambda calculus using Stoughton's substitution
E Copello, N Szasz, Á Tasistro
Theoretical Computer Science 685, 65-82, 2017
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
A machine checked proof that Ackermann’s function is not primitive recursive
N Szasz
Logical Environments, 317-338, 1993
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
Institution-based semantics for MOF and QVT-relations
D Calegari, N Szasz
Formal Methods: Foundations and Applications: 16th Brazilian Symposium, SBMF …, 2013
Specification of a smart card operating system
G Betarte, C Cornes, N Szasz, A Tasistro
Types for Proofs and Programs: International Workshop, TYPES’99 Lökeberg …, 2000
Principal type scheme for session types
A Tasistro, E Copello, N Szasz
Int. J. Logic Comput 3 (1), 34-43, 2012
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
Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution
M Copes, N Szasz, A Tasistro
arXiv preprint arXiv:1807.01871, 2018
Bridging Technological Spaces for the Verification of Model Transformations.
D Calegari, N Szasz
CIbSE, 43-56, 2013
A theory of specifications, programs and proofs
N Szasz
Chalmers University of Technology, Department of Computing Science, 1997
The system can't perform the operation now. Try again later.
Articles 1–20