<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p>We are extending the LangSec 2021 deadline to Feb 7th, 2021;
apologies for multiple postings. </p>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 14px;" lang="x-unicode">Call for Papers<br>
7th Workshop on Language-Theoretic Security (LangSec)<br>
Affiliated with 42nd IEEE Symposium on Security and Privacy
(Oakland)<br>
May 27th, 2021<br>
<br>
The Language-Theoretic Security (LangSec) workshop solicits<br>
contributions of research papers, work-in-progress reports, and
panels<br>
related to the growing area of language-theoretic security.<br>
<br>
Submission Guidelines: see <a class="moz-txt-link-freetext" href="http://langsec.org/spw21/">http://langsec.org/spw21/</a><br>
<br>
Submission link: <a class="moz-txt-link-freetext" href="https://easychair.org/conferences/?conf=langsec2021">https://easychair.org/conferences/?conf=langsec2021</a><br>
<br>
Important Dates:<br>
Research paper submissions due: Feb 7th 2021, AOE<br>
Work-in-progress reports and panels submissions due:<br>
Feb 7th 2021, AOE<br>
Notification to authors: Feb 28th 2021<br>
Camera ready: March 15 2021<br>
<br>
Topics: LangSec posits that the only path to trustworthy computer<br>
software that takes untrusted inputs is treating all valid or
expected<br>
inputs as a formal language, and the respective input-handling
routine<br>
as a parser for that language. The parsing must be feasible, and
the<br>
parser must match the language in required computation power and<br>
convert the input for the consumption of subsequent computation.
The<br>
7th installation of the workshop will continue the tradition and<br>
further focus on research that apply the language-theoretic<br>
perspective to policy mechanisms, such as treating policy
formulation<br>
and enforcement as language definition and language recognition<br>
problems. The following is a non-exhaustive list of topics that
are of<br>
relevance to LangSec:</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 14px;" lang="x-unicode"><br>
</div>
* formalization of vulnerabilities and exploits in terms of language<br>
theory<br>
* inference of formal language specifications of data from samples<br>
* generation of secure parsers from formal language specifications<br>
* complexity hierarchy of verifying parser implementations<br>
* science of protocol design: layering, fragmentation and
re-assembly,<br>
extensibility, etc.<br>
* architectural constructs for enforcing limits on computational<br>
complexity<br>
* empirical data on programming language features/programming styles<br>
that affect bug introduction rates (e.g., syntactic redundancy)<br>
* systems architectures and designs based on LangSec principles<br>
* computer languages, file formats, and network protocols built on<br>
LangSec principles<br>
* re-engineering efforts of existing languages, formats, and
protocols<br>
to reduce computational power<br>
<br>
Chairs<br>
PC co-chair: Gang Tan (Pennsylvania State University)<br>
PC co-chair: Sergey Bratus (Dartmouth College)<br>
<br>
Contact:<br>
All questions about submissions should be emailed to the PC chairs:<br>
Gang Tan (<a class="moz-txt-link-abbreviated" href="mailto:gtan@psu.edu">gtan@psu.edu</a>) and Sergey Bratus (<a class="moz-txt-link-abbreviated" href="mailto:sergey@cs.dartmouth.edu">sergey@cs.dartmouth.edu</a>)
<pre class="moz-signature" cols="72">--
Gang (Gary) Tan
Professor, Penn State CSE and ICDS
W358 Westgate Building
<a class="moz-txt-link-freetext" href="http://www.cse.psu.edu/~gxt29">http://www.cse.psu.edu/~gxt29</a>
<a class="moz-txt-link-freetext" href="Tel:814-8657364">Tel:814-8657364</a></pre>
</body>
</html>