نتایج جستجو برای: trace constraint

تعداد نتایج: 144250  

Journal: :research in applied linguistics 2013
ahmad alibabaee manijeh youhanaee

this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

2002
Mireille Ducassé Ludovic Langevine

The operational behavior of constraint programs is not easy to understand. We propose an approach where high-level views of executions are built on top of low-level tracers. We describe an analysis module which can analyze on the y execution traces. Application programmers or end-users can easily program trace analysis tools without knowing any implementation details about the solver or the tra...

This study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by Persian-speaking L2 learners of English in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of UGin adult SLA. To do so, 92 participants were assigned into different levels of L2knowledge based on their performances on the Oxford Placeme...

2004
Gérard Ferrand Willy Lesaint Alexandre Tessier

Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU-Prolog, PaLM, CHIP). Because of the large size of traces, even for small toy problems, some tools are needed to understand this trace. Explanations of value withdrawal (or nogoods) are used during domain reduction by some solv...

2012
Vincent Cheval Véronique Cortier Stéphanie Delaune

Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be de ned (or cannot be naturally de ned) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related prop...

Journal: :Theor. Comput. Sci. 2013
Vincent Cheval Véronique Cortier Stéphanie Delaune

Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be defined (or cannot be naturally defined) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related pr...

Journal: :Calculus of Variations and Partial Differential Equations 2017

2009
Dazhi Zhang Donggang Liu Wenhua Wang Jeff Lei David Kung Christoph Csallner

Security testing has gained significant attention recently due to the huge number of attacks against software systems. This paper presents a novel security testing method using trace-based symbolic execution and satisfiability analysis. It reuses test cases generated from traditional functional testing to produce execution traces. An execution trace is a sequence of program statements exercised...

2013
Tara McAllister Byun Sharon Inkelas Yvan Rose

This paper addresses two linked phenomena of longstanding interest: the existence of childspecific phonological patterns which are not attested in adult language, and the puzzling developmental trajectory of these patterns. While some child-specific phonological patterns wane gradually as the child matures, others follow a U-shaped curve, and still others persist unchanged for an extended perio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید