Filters








6,419 Hits in 3.1 sec

Practical SMT-based type error localization

Zvonimir Pavlinovic, Tim King, Thomas Wies
2015 Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015  
In our experimental evaluation, we found that the algorithm reduces the running times for optimal type error localization from minutes to seconds and scales better than previous localization algorithms  ...  Our algorithm uses an improved SMT encoding to cope with the high complexity of polymorphic typing by iteratively expanding the typing constraints from which principal types are derived.  ...  To our knowledge, this is the first type error localization algorithm that guarantees optimal solutions and is fast enough to be usable in practice.  ... 
doi:10.1145/2784731.2784765 dblp:conf/icfp/Pavlinovic0W15 fatcat:rumig4j6efcppgzxojphe74vsq

Practical SMT-based type error localization

Zvonimir Pavlinovic, Tim King, Thomas Wies
2015 SIGPLAN notices  
In our experimental evaluation, we found that the algorithm reduces the running times for optimal type error localization from minutes to seconds and scales better than previous localization algorithms  ...  Our algorithm uses an improved SMT encoding to cope with the high complexity of polymorphic typing by iteratively expanding the typing constraints from which principal types are derived.  ...  To our knowledge, this is the first type error localization algorithm that guarantees optimal solutions and is fast enough to be usable in practice.  ... 
doi:10.1145/2858949.2784765 fatcat:n45iczfky5fndjr2va6y5lp6ue

On Practical SMT-Based Type Error Localization [article]

Zvonimir Pavlinovic, Tim King, Thomas Wies
2015 arXiv   pre-print
In our experimental evaluation, we found that the algorithm reduces the running times for optimal type error localization from minutes to seconds and scales better than previous localization algorithms  ...  Our algorithm uses an improved SMT encoding to cope with the high complexity of polymorphic typing by iteratively expanding the typing constraints from which principal types are derived.  ...  size. • To our knowledge, this is the first algorithm for type error localization that gives formal optimality guarantees and has the potential to be usable in practice.  ... 
arXiv:1508.06836v1 fatcat:fxieczlpsrduniticmxse3vwqi

MaxSMT-Based Type Inference for Python 3 [chapter]

Mostafa Hassan, Caterina Urban, Marco Eilers, Peter Müller
2018 Lecture Notes in Computer Science  
We present Typpete, a sound type inferencer that automatically infers Python 3 type annotations.  ...  Typpete encodes type constraints as a MaxSMT problem and uses optional constraints and specific quantifier instantiation patterns to make the constraint solving process efficient.  ...  The type inference is constraint-based and relies on the off-the-shelf SMT solver Z3 [7] for finding a valid type assignment for the input program.  ... 
doi:10.1007/978-3-319-96142-2_2 fatcat:jjzfgxpx5rfcfbman2muiq2ufu

What do post-editors correct? A fine-grained analysis of SMT and NMT errors

Sergi Alvarez-Vidal, Antoni Oliver, Toni Badia
2021 Tradumàtica tecnologies de la traducció  
We present a pilot study of a fine-grained analysis of MT errors based on post-editors corrections for an English to Spanish medical text translated with SMT and NMT.  ...  The recent improvements in neural MT (NMT) have driven a shift from statistical MT (SMT) to NMT.  ...  Castilho et al. (2017) reported on a comparative study of phrase-based SMT (PBSMT) Koponen et al. (2019) presented a comparison of PE changes performed on NMT, rule-based MT (RBMT) and SMT output for  ... 
doi:10.5565/rev/tradumatica.286 fatcat:725mcpojtnblho4e5atokp7s64

Adapting Grammatical Error Correction Based on the Native Language of Writers with Neural Network Joint Models

Shamil Chollampatt, Duc Tam Hoang, Hwee Tou Ng
2016 Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing  
An important aspect for the task of grammatical error correction (GEC) that has not yet been adequately explored is adaptation based on the native language (L1) of writers, despite the marked influences  ...  In this paper, we adapt a neural network joint model (NNJM) using L1-specific learner text and integrate it into a statistical machine translation (SMT) based GEC system.  ...  Computing per error type F 0.5 scores is difficult for SMT-based GEC systems, as the error types for corrections proposed by the SMTbased GEC system cannot be determined trivially.  ... 
doi:10.18653/v1/d16-1195 dblp:conf/emnlp/ChollampattHN16 fatcat:o53yadoiljhxbfg3tqkavl4ula

Counterexample guided inductive optimization based on satisfiability modulo theories

Rodrigo F. Araújo, Higo F. Albuquerque, Iury V. de Bessa, Lucas C. Cordeiro, João E. Chaves Filho
2018 Science of Computer Programming  
This paper describes three variants of a counterexample guided inductive optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT) solvers.  ...  In particular, CEGIO relies on iterative executions to constrain a verification procedure, in order to perform inductive generalization, based on counterexamples extracted from SMT solvers.  ...  The authors formulate this approach as an optimization problem related to SMT and use νZ to compute an optimal error source in a given ill-typed program.  ... 
doi:10.1016/j.scico.2017.10.004 fatcat:6ogg5lwxargzrlg3hpmhxtqhqm

PIPE+Verifier - A Tool for Analyzing High Level Petri Nets

Su Liu, Xudong He
2015 Proceedings of the 27th International Conference on Software Engineering and Knowledge Engineering  
In our prior work, we have developed a method based on BMC and a supporting tool PIPE+Verifier to analyze high level Petri nets using a state of the art satisfiability modulo theories (SMT) solver Z3 as  ...  BMC sacrifices the completeness of traditional model checking but becomes more practical and often effective to analyze large models.  ...  Structured token types defined in the HLPN are mapped to tuples in SMT, and primitive token types such as integer and strings are encoded as Integer in SMT.  ... 
doi:10.18293/seke2015-60 dblp:conf/seke/LiuH15 fatcat:anpac22fpnbaveixy4ztf46tzm

DepRes: A Tool for Resolving Fully Qualified Names and Their Dependencies [article]

Ali Shokri, Mehdi Mirakhorli
2021 arXiv   pre-print
., StackOverflow) is a common practice followed by software developers.  ...  In this paper, we introduce DepRes, a tool that leverages a sketch-based approach to resolve FQNs in java-based code snippets and recommend the correct dependency for each FQN.  ...  Sketching module uses communicates with Eclipse JDT to creaete typed ASTs. For solving SMT problems, Z3 SMT Solver is utilized in resolving module. B.  ... 
arXiv:2108.01165v1 fatcat:t762m6g7ozeypofl627lnuf37a

Spin-mixing-tunneling network model for Anderson transitions in two-dimensional disordered spinful electrons

Jie Lu, Bin Xi, Mei Li
2018 New Journal of Physics  
With the help of high-accuracy numerics based on transfer matrix technique, finite-size analysis on two-terminal conductance and normalized localization length provides a phase diagram drawn in the SMT-SPT  ...  A symplectic quantum network model, named as SMT-QNM, is constructed in which SMT and SPT have the same status and contribute independent tunneling channels rather than sharing a total-probability-fixed  ...  Figure 3 . 3 An example of the layout of a SMT-QNM network with boundary nodes being S'-type PSPs. The light (dark) gray circles indicate S-type (S'-type) PSPs.  ... 
doi:10.1088/1367-2630/aad6d6 fatcat:22cl3ehgundgllkmt5pkqn5fem

Localizing Router Configuration Errors Using Minimal Correction Sets [article]

Aaron Gember-Jacobson, Ruchit Shrestha, Xiaolin Sun
2022 arXiv   pre-print
Router configuration errors are unfortunately common and difficult to localize using current network verifiers.  ...  We introduce a novel configuration error localizer (CEL) that precisely identifies which configuration segments contribute to the violation of forwarding requirements.  ...  Using MCS-based error localization in this scenario is difficult due to the way existing SMT-based models handle failures.  ... 
arXiv:2204.10785v1 fatcat:hwe5emjr55dexk2yn6aqt3qdcm

System Combination for Grammatical Error Correction

Raymond Hendy Susanto, Peter Phandi, Hwee Tou Ng
2014 Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)  
Most of these approaches are based on classification or statistical machine translation (SMT).  ...  In this paper, we propose to combine the output from a classification-based system and an SMT-based system to improve the correction quality.  ...  The intuition is that most error types do not involve long-range reordering and local reordering can be easily captured in the phrase translation table.  ... 
doi:10.3115/v1/d14-1102 dblp:conf/emnlp/SusantoPN14 fatcat:alkuyb7jx5bwpkzadnh6geqrzi

A Hybrid System for Chinese Grammatical Error Diagnosis and Correction

Chen Li, Junpei Zhou, Zuyi Bao, Hengyou Liu, Guangwei Xu, Linlin Li
2018 Proceedings of the 5th Workshop on Natural Language Processing Techniques for Educational Applications  
for errors of M and S types.  ...  This task aims at not only detecting four types of grammatical errors including redundant words (R), missing words (M), bad word selection (S) and disordered words (W), but also recommending corrections  ...  The SMT model can handle some errors whose type is R, even that part seems reasonable in the local context.  ... 
doi:10.18653/v1/w18-3708 dblp:conf/acl-tea/LiZBLXL18 fatcat:tiv2m6vi5ne7hkdezibgrjleai

Automatically testing string solvers

Alexandra Bugariu, Peter Müller
2020 Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering  
The experimental evaluation shows that our technique effectively reveals bugs in the implementation of widely-used SMT solvers and applies also to other types of solvers, such as automatabased solvers.  ...  For all these applications to provide reliable results, SMT solvers must answer queries correctly.  ...  For all these tools to be reliable and usable in practice, the SMT solvers have to provide correct answers.  ... 
doi:10.1145/3377811.3380398 dblp:conf/icse/Bugariu020 fatcat:yyiirnlegvgttpcpu4sdg4bppa

SMT-Friendly Formalization of the Solidity Memory Model [article]

Ákos Hajdu, Dejan Jovanović
2020 arXiv   pre-print
In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories.  ...  in practice.  ...  The syntax is purposefully minimal and generic, so that it can be expressed in any modern SMT-based verification tool (e.g., Boogie [5] and Why3 [19] ). 4 The types of SMT-based programs are the SMT  ... 
arXiv:2001.03256v1 fatcat:zhblyr3dgfdypp53erjb7wbkrm
« Previous Showing results 1 — 15 out of 6,419 results