Travelled to:1 × Czech Republic
1 × Luxembourg
1 × Portugal
1 × Singapore
1 × United Kingdom
1 × Uruguay
2 × Italy
2 × Switzerland
5 × USA
Collaborated with:N.Aguirre P.Ponzio J.P.Galeotti N.Rosner C.L.Pombo V.S.Bengolea M.M.Moscato T.S.E.Maibaum R.D.Maddux S.Khurshid G.Regis M.Politano D.Marinov B.C.Parrino D.Garbervetsky R.Degiovanni R.Gamarra G.Steren L.Bourg W.Visser J.H.Siddiqui A.Wassyng G.Baum M.Uva A.J.Sampaio A.M.Haeberer C.T.Prates C.D.Ururahy N.C.Albuquerque S.A.Khalek S.Bermúdez G.M.Blas S.P.D.Rosso L.Pizzagalli L.Zemín C.Cornejo S.G.Brida F.Raverta J.P.Galeotti P.Abad D.Ciolek I.Vissani
Talks about:bound (9) alloy (9) analysi (7) specif (6) test (6) base (5) program (4) generat (4) exhaust (4) verif (4)
Person: Marcelo F. Frias
DBLP: Frias:Marcelo_F=
Contributed to:
2014
2014
2013
2013
2013
2012
201120112010
2009
20072005
20052003
1998
2016
2017
199520172019Wrote 21 papers:
- FM-2014-PonzioRAF #bound #performance
- Efficient Tight Field Bounds Computation Based on Shape Predicates (PP, NR, NA, MFF), pp. 531–546.
- OOPSLA-2014-RosnerBPKAFK #bound #generative #hybrid #invariant
- Bounded exhaustive test input generation from hybrid invariants (NR, VSB, PP, SAK, NA, MFF, SK), pp. 655–674.
- ASE-2013-RosnerSAKF #alloy #analysis #clustering #modelling #named #parallel
- Ranger: Parallel analysis of alloy models by range partitioning (NR, JHS, NA, SK, MFF), pp. 147–157.
- ICST-2013-AbadABCFGMMRV #bound #contract #generative #incremental #satisfiability #testing
- Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving (PA, NA, VSB, DC, MFF, JPG, TSEM, MMM, NR, IV), pp. 21–30.
- ISSTA-2013-RosnerGBBRPZF #analysis #bound #invariant #parallel #refinement
- Parallel bounded analysis in code with rich invariants by refinement of field bounds (NR, JPG, SB, GMB, SPDR, LP, LZ, MFF), pp. 23–33.
- TAP-2012-BengoleaAMF #bound #test coverage #testing #using
- Using Coverage Criteria on RepOK to Reduce Bounded-Exhaustive Test Suites (VSB, NA, DM, MFF), pp. 19–34.
- SEFM-2011-ParrinoGGF #analysis #bound #data flow #satisfiability #verification
- A Dataflow Analysis to Improve SAT-Based Bounded Program Verification (BCP, JPG, DG, MFF), pp. 138–154.
- TAP-2011-AguirreBFG #black box #bound #generative #test coverage #testing
- Incorporating Coverage Criteria in Bounded Exhaustive Black Box Test Generation of Structural Inputs (NA, VSB, MFF, JPG), pp. 15–32.
- TAP-2011-DegiovanniPAF #abstraction #automation #generative #requirements #specification #testing
- Abstraction Based Automated Test Generation from Formal Tabular Requirements Specifications (RD, PP, NA, MFF), pp. 84–101.
- ISSTA-2010-GaleottiRPF #analysis #bound #invariant #performance #verification
- Analysis of invariants for efficient bounded verification (JPG, NR, CLP, MFF), pp. 25–36.
- FASE-2009-AguirreFMMW #alloy #behaviour #specification #using
- Describing and Analyzing Behaviours over Tabular Specifications Using (Dyn)Alloy (NA, MFF, MMM, TSEM, AW), pp. 155–170.
- TACAS-2007-FriasPM #alloy #analysis #specification #verification
- Alloy Analyzer+PVS in the Analysis and Verification of Alloy Specifications (MFF, CLP, MMM), pp. 587–601.
- ASE-2005-FriasGSB #analysis #performance #relational #specification #verification
- A strategy for efficient verification of relational specifications, based on monotonicity analysis (MFF, RG, GS, LB), pp. 305–308.
- ICSE-2005-FriasGPA #alloy #named
- DynAlloy: upgrading alloy with actions (MFF, JPG, CLP, NA), pp. 442–451.
- FME-2003-FriasPBAM #alloy
- Taking Alloy to the Movies (MFF, CLP, GB, NA, TSEM), pp. 678–697.
- LICS-1998-FriasM #calculus #relational
- Completeness of a Relational Calculus for Program Schemes (MFF, RDM), pp. 127–134.
- FSE-2016-PonzioAFV #testing
- Field-exhaustive testing (PP, NA, MFF, WV), pp. 908–919.
- ESEC-FSE-2017-RegisCBPRPAGF #alloy #analysis #behaviour #modelling #specification
- DynAlloy analyzer: a tool for the specification and analysis of alloy models with dynamic behaviour (GR, CC, SGB, MP, FR, PP, NA, JPG, MFF), pp. 969–973.
- TAPSOFT-1995-SampaioHPUFA #named #programming #proving #term rewriting
- PLATO: A Tool to Assist Programming as Term Rewriting and Therem Proving (AJS, AMH, CTP, CDU, MFF, NCA), pp. 797–798.
- FASE-2017-UvaPRAF #automation #java #satisfiability #specification
- Automated Workarounds from Java Program Specifications Based on SAT Solving (MU, PP, GR, NA, MFF), pp. 356–373.
- FASE-2019-PonzioBPAF #api #automation #identification
- Automatically Identifying Sufficient Object Builders from Module APIs (PP, VSB, MP, NA, MFF), pp. 427–444.